37 lines
1 KiB
Text
37 lines
1 KiB
Text
|
(c) Copyright 2005, Ian Clarke, Oskar Sandberg
|
||
|
|
Released under the GNU General Public License Version 2
|
||
|
|
|
||
|
|
Requirements
|
||
|
|
------------
|
||
|
|
Needs Java 1.5 or later
|
||
|
|
|
||
|
|
Instructions
|
||
|
|
------------
|
||
|
|
From this directory:
|
||
|
|
|
||
|
|
$ java -cp bin Main <seed>
|
||
|
|
|
||
|
|
Seed can be any integer and it will be used as the seed for the random
|
||
|
|
number generator. We used 8011 in our talk.
|
||
|
|
|
||
|
|
The display shows a network where nodes have been assigned locations in
|
||
|
|
2D space. At the bottom a histogram of connection lengths is shown.
|
||
|
|
|
||
|
|
Once it starts, hit any key to advance onto the next stage. The stages are
|
||
|
|
as follows:
|
||
|
|
|
||
|
|
1. Display an ideal small world network (according to Kleinberg's proof).
|
||
|
|
Note that nodes are actually positioned on a grid, but are offset
|
||
|
|
randomly by a few pixels to make connections easier to see.
|
||
|
|
|
||
|
|
2. Show a route between two nodes
|
||
|
|
|
||
|
|
3. Randomize the network
|
||
|
|
|
||
|
|
4. Show an attempted route between two nodes
|
||
|
|
|
||
|
|
5. Show our algorithm "restoring" the network, one node and its connections
|
||
|
|
are highlighted in green
|
||
|
|
|
||
|
|
6. Show a route between two nodes
|