| Subject | Datestamp | Replies | Score | |||
|---|---|---|---|---|---|---|
| Re:My RH6 Gotch's | ||||||
| attached to CPU Review evaluates Redhat 6.0 | ||||||
| Subject | Datestamp | Replies | Score | |||
|---|---|---|---|---|---|---|
| Re:My RH6 Gotch's | ||||||
| attached to CPU Review evaluates Redhat 6.0 | ||||||
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