Comment motivation (Score 1) 44
very good your argument in your post friend continues so you will go far thanks
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