I think that's what Rolf was talking about when he spoke about circular dependencies.
You need to end up with (what we called in my IT studies, my translation into English might be faulty) a cycle-less oriented graph.
In reply to Re^2: Sorting by dependencies
by Laurent_R
in thread Sorting by dependencies
by Anonymous Monk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |