Re: Finding the set of recursive calls

"Hans Aberg" <haberg@matematik.su.se> schreibt:


>In a directed graph, the equivalence relation used to define strongly
>connected components is that there are paths both ways between vertices.


In a discussion with Prof. Eppstein it turned out, that a vertex can
form a strongly connected component, even if no explicit path exists
from the vertex back to itself. This is due to the reflexive property
of equivalence relations. Thus the set of recursive procedures is
only a subset of the strongly connected components of an graph.


So in the case of the set of recursive calls I'm not sure, which
algorithms really are applicable without modificiations. The set of
strongly connected components can be used as a base, from which all
single-vertex components must be removed, which have no edges to
themselves.


(I knew that there was a problem... ;-)


DoDi

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