Enter the number of nodes in the graph and the probability of an edge.
RANDOM GRAPH generates a random graph and displays it. DFS shows the
depth first search. To begin with,
the nodes are red and edges are white. When a node is visited, the color
changes to green. When the visit is complete, the color changes to blue.
The edge changes to red when the edge is a tree edge. The other edges
(forward and back) remain white. CHECKER checks the output.
It is interesting to try the CHECKER while DFS is not complete to see
it output ``FAIL''.
source file.