| Subject | Datestamp | Replies | Score | |||
|---|---|---|---|---|---|---|
| so cute | ||||||
| attached to Journal Discussion: Life | ||||||
| Subject | Datestamp | Replies | Score | |||
|---|---|---|---|---|---|---|
| so cute | ||||||
| attached to Journal Discussion: Life | ||||||
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