Re: Finding the set of recursive calls

"VBDis" <vbdis@aol.com> wrote:


>>Possibly, you need a version for a undirected graph.
>
>Isn't in an undirected graph any node recursive, which has at least
>one edge attached? Follow that edge forth and back again...


In a directed graph, the equivalence relation used to define strongly
connected components is that there are paths both ways between vertices.
In an undirected graph, then this just reduces to being a connected
component, as one always can travel both ways.


So in an undirected graph, Tarjan's algorithm (if hooked up this way)
merely produces the connected components .


    Hans Aberg * Anti-spam: remove "remove." from email address.
                                    * Email: Hans Aberg <remove.haberg@member.ams.org>
                                    * Home Page: <http://www.matematik.su.se/~haberg/>
                                    * AMS member listing: <http://www.ams.org/cml/>

Return to the comp.compilers page.
Search the comp.compilers archives again.