| Subject | Datestamp | Replies | Score | |||
|---|---|---|---|---|---|---|
| Re:Panic | ||||||
| attached to Mars Attacked, 65 Years Ago Today | ||||||
| Re:What is it good for? | ||||||
| attached to Teach Yourself AppleScript in 24 Hours | ||||||
| Subject | Datestamp | Replies | Score | |||
|---|---|---|---|---|---|---|
| Re:Panic | ||||||
| attached to Mars Attacked, 65 Years Ago Today | ||||||
| Re:What is it good for? | ||||||
| attached to Teach Yourself AppleScript in 24 Hours | ||||||
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