Fortune Linuxando
_ _ _ _ _ _ _ _ _ _ _ _ _
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
^__^ (==)\_______ (__)\ )\/\ ||----w | || ||
xclock -digital -update 1