| Subject | Datestamp | Replies | Score | |||
|---|---|---|---|---|---|---|
| Easy test... | ||||||
| attached to Time Travel | ||||||
| Re:Semi-stable working PHP | ||||||
| Semi-stable working PHP | ||||||
| attached to I'll run Apache 2.0.... | ||||||
| Re:Surely not fast enough in fact... | ||||||
| attached to Apple Security Update Posted | ||||||
| Subject | Datestamp | Replies | Score | |||
|---|---|---|---|---|---|---|
| Easy test... | ||||||
| attached to Time Travel | ||||||
| Re:Semi-stable working PHP | ||||||
| Semi-stable working PHP | ||||||
| attached to I'll run Apache 2.0.... | ||||||
| Re:Surely not fast enough in fact... | ||||||
| attached to Apple Security Update Posted | ||||||
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