4 Aug 2002 11:39:24 -0400

Related articles |
---|

Finding the set of recursive calls jeremy.wright@microfocus.com (Jeremy Wright) (2002-07-21) |

Re: Finding the set of recursive calls haberg@matematik.su.se (Hans Aberg) (2002-07-24) |

Re: Finding the set of recursive calls dietz@dls.net (Paul F. Dietz) (2002-07-24) |

Re: Finding the set of recursive calls Martin.Ward@durham.ac.uk (Martin Ward) (2002-07-24) |

Re: Finding the set of recursive calls vbdis@aol.com (VBDis) (2002-07-24) |

Re: Finding the set of recursive calls jeremy.wright@microfocus.com (Jeremy Wright) (2002-07-25) |

Re: Finding the set of recursive calls vbdis@aol.com (VBDis) (2002-07-31) |

Re: Finding the set of recursive calls haberg@matematik.su.se (Hans Aberg) (2002-08-04) |

Re: Finding the set of recursive calls vbdis@aol.com (VBDis) (2002-08-10) |

Re: Finding the set of recursive calls vbdis@aol.com (VBDis) (2002-08-10) |

Re: Finding the set of recursive calls haberg@matematik.su.se (Hans Aberg) (2002-08-14) |

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

Newsgroups: | comp.compilers |

Date: | 4 Aug 2002 11:39:24 -0400 |

Organization: | Mathematics |

References: | 02-07-090 02-07-133 |

Keywords: | analysis |

Posted-Date: | 04 Aug 2002 11:39:24 EDT |

"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/>

Post a followup to this message

Return to the
comp.compilers page.

Search the
comp.compilers archives again.