Question on tree-walking and mutually-recursive types

[Kai Henningsen]

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