Lollipop Graph Traversal Problem
by Jim Susinno

This app was designed in glut to visualize the lollipop graph traversal problem.









Download:
win32 executable - requires cygwin1.dll


Installation:
Double-click the lollipop.exe app to run.
If Windows complains about a missing .dll file cygwin1.dll, download that file and
copy it to the same directory as lollipop.exe or to C:\WINDOWS.


Usage:
To start the simulation, press a.
To take a single step, press q.

Escape will bring up a prompt for a new node count.  Enter any number and press return
to restart the simulation with that number of nodes.  Range from 2 to 255.

The mouse controls viewing parameters.  Click within the window and drag to induce change.
Left button rotates the histogram link display.
Right and middle buttons will move the camera in space(within a certain bound).


The data display in the upper left indicates current simulation parameters.
The number of nodes is indicated in the first line.
The number of steps taken in the current simulation run is displayed next, with the
current location of the traversal indicated in parentheses.
The 'max steps' field indicates the maximum number of times one link has been traversed.

In blue, the 'possible moves' display indicated the nodes which can be traversed to from 
the current node.

Once a traversal completes, the number of steps requires will be displayed in yellow.

The numerical matrix display represents the connectivity matrix of the lollipop graph.
The second copy displayed below is a "folded" version of the same matrix, with each link
counting towards the total of its reciprocal partner: e.g. (1,2) and (2,1) counted together.



This application requires cygwin1.dll, part of the cygwin package.