| Subject | Datestamp | Replies | Score | |||
|---|---|---|---|---|---|---|
| Apple: Big Target | ||||||
| attached to Thieves Clear Out Apple Store In 31 Seconds | ||||||
| Some personal experience | ||||||
| attached to Advice on Learning Japanese? | ||||||
| Subject | Datestamp | Replies | Score | |||
|---|---|---|---|---|---|---|
| Apple: Big Target | ||||||
| attached to Thieves Clear Out Apple Store In 31 Seconds | ||||||
| Some personal experience | ||||||
| attached to Advice on Learning Japanese? | ||||||
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