Comment Re:Who is this anonymous? (Score 1) 779
Call me Ishmael.
The algorithm for finding the longest path in a graph is NP-complete. For you systems people, that means it's *real slow*. -- Bart Miller