ScuttleMonkey from the phone-calls-that-get-your-party-members-killed dept.
ScoopFlash writes to tell us that TechEBlog has assembled what they consider to be some of the strangest computer mice ever put to market, complete with pictures. I just hope I don't need to answer the phone in the middle of an important instance.
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