This is the mail archive of the
gcc@gcc.gnu.org
mailing list for the GCC project.
Re: Question on tree-walking and mutually-recursive types
- From: kaih at khms dot westfalen dot de (Kai Henningsen)
- To: gcc at gcc dot gnu dot org
- Date: 29 Jun 2004 21:42:00 +0200
- Subject: Re: Question on tree-walking and mutually-recursive types
- Comment: Unsolicited commercial mail will incur an US$100 handling fee per received mail.
- Organization: Organisation? Me?! Are you kidding?
- References: <200406291641.16989.riphack@web.de>
riphack@web.de (Locke) wrote on 29.06.04 in <200406291641.16989.riphack@web.de>:
> What speaks against tpological sort? it is the same problem as in directed
> graphs and topological sort runs in O(number of nodes) which should be the
> fastest.
Tortoise&Hare *also* runs in O(number of nodes), and I'm pretty sure the
constant is smaller than sorting.
MfG Kai