Comment The FSM is prolly disapointed, but... (Score 0) 136
"The University gave no word on the possibility of tentacles in future models."
i know i am not the only one who read this as '...TESTICLES in future...'
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