| Subject | Datestamp | Replies | Score | |||
|---|---|---|---|---|---|---|
| Re:Cool Case Designs | ||||||
| attached to Cool Cases: the Rust-Box | ||||||
| Subject | Datestamp | Replies | Score | |||
|---|---|---|---|---|---|---|
| Re:Cool Case Designs | ||||||
| attached to Cool Cases: the Rust-Box | ||||||
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