Comment Re:Oops we um... er... (Score 0) 127
Oh, never mind. While I was being witty someone mirrored it. Ta.
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