04:24 pm, 12 Nov 04

### wikipedia sixdegrees

Wikipedia six degrees. Someone else did it, apparently a while ago. Couldn't find it on a search engine.

It keeps the links table in memory and the author said it uses dijkstra's algorithm. (How is this different than a breadth-first search?)

It keeps the links table in memory and the author said it uses dijkstra's algorithm. (How is this different than a breadth-first search?)

zezuIsn't Dijkstra's algorithm for finding the shortest path? Requires extra storage on each node for visited/not?

evananadamous2. 2001

3. August_9

4. Dmitri_Shostakovich

5. Fool