| Subject | Datestamp | Replies | Score | |||
|---|---|---|---|---|---|---|
| Re:Haha a hahaha ahaha HAAA!! | ||||||
| attached to Google Trials A9 Style Image Search | ||||||
| Re:just use netbsd already | ||||||
| attached to NTFS Support For OpenBSD | ||||||
| Subject | Datestamp | Replies | Score | |||
|---|---|---|---|---|---|---|
| Re:Haha a hahaha ahaha HAAA!! | ||||||
| attached to Google Trials A9 Style Image Search | ||||||
| Re:just use netbsd already | ||||||
| attached to NTFS Support For OpenBSD | ||||||
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