Quote:
|
Originally Posted by Ooble
Look up Dijkstra's shortest path algorithm. It's easy - I had to do it in an exam yesterday, and if I can pull it off, anyone can.
|
Don't speak to soon: we may have all failed...
Anyway you should be revising today (yes I've been defeated by my own logic you needn't point that out).