On Tue, 2008-01-29 at 12:04 -0800, Ben Tilly wrote: > [snip] > That is logically unavoidable.
Yup, and in fact provably true. The problem is the same as finding a topological ordering among a directed acyclic graph. Wikipedia can inform you more on the topic ( http://en.wikipedia.org/wiki/Topological_sort ) but a better reference is the canonical "Introduction to Algorithms" by Cormen, Leiserson, Rivest, and Stein. - Alex -- Networking -- only one letter away from not working _______________________________________________ Boston-pm mailing list Boston-pm@mail.pm.org http://mail.pm.org/mailman/listinfo/boston-pm
