The Rotor Router Model is composed of a directed graph (infinite or finite) with a rotor attached to each vertex. The rotor at a given vertex is a pointer to one of the edges that leaves that vertex. In the model, a bug traverses the graph along the edges, following the direction of the rotor at each vertex.
The twist is that each time a bug visits a vertex, she rotates the rotor so that it points to the next edge, before following the rotor.
This is a deterministic system.
A sink is a vertex with no edges leaving it, If there is a sink in the system, it has no rotor on it. If a bug visits a sink, she disappaers from the system. After that happens, we put a new bug on some specified vertex, called the source.
Instructions
There are three graph to choose from: A, B, or C.
To switch between graphs, choose one from the drop-down menu and hit “Reset”.
Credits.
This work is Copyright (C) 2003 Hal Canary, University of Wisconsin-Madison.
This work was supported by a the University of Wisconsin.
This work comes with ABSOLUTELY NO WARRANTY. This program is free software; you can redistribute it and/or modify it under the terms of version 2 of the GNU General Public License as published by the Free Software Foundation.