Comment I'm Sure... (Score 5, Funny) 339
...that the mirror companies decision to pay for some of the cost will reflect well on them over time.
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