Question on tree-walking and mutually-recursive types

[Locke]

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.

cu, Locke