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.