31 Jul 2002 00:59:32 -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: | "VBDis" <vbdis@aol.com> |

Newsgroups: | comp.compilers |

Date: | 31 Jul 2002 00:59:32 -0400 |

Organization: | AOL Bertelsmann Online GmbH & Co. KG http://www.germany.aol.com |

References: | 02-07-090 |

Keywords: | analysis |

Posted-Date: | 31 Jul 2002 00:59:31 EDT |

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

*>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...

DoDi

Post a followup to this message

Return to the
comp.compilers page.

Search the
comp.compilers archives again.