What is the output of `tsort` in the case of cycles?  I think it is important to be able to detect when not all dependencies can be satisfied because of cycles and not be silent about it.  (But an exception would be too noisy for general code.)

If one wants to have a meaningful output in the case of cyclic graphs, I would consider Tarjan's algorithm for SCCs (mentioned earlier on this list by me) instead.

[...]