|
David Lovelock, Andy Halper and Chandi Hunt
Department of Mathematics
University of Arizona
Tucson, Arizona 85721
|
This self-extracting program will allow you to experiment
with undirected, unweighted graphs. It can also decide whether
a graph is planar, connected, has an Euler circuit, Euler path,
or Hamilton cycle. The graph can have up to 26 vertices.
|
Download graph.exe [211 KB].
Look at other programs in the University
of Arizona collection.
|
|