Public Member Functions | |
void | testGraph1 () |
void | testGraph2 () |
Testing various graph algorithms.
Definition at line 24 of file GraphTest.java.
void edu.mit.csail.sdg.squander.examples.graph2.GraphTest.testGraph1 | ( | ) |
Definition at line 27 of file GraphTest.java.
References edu.mit.csail.sdg.squander.examples.graph2.Graph.addNode(), edu.mit.csail.sdg.squander.examples.graph2.Graph.hamiltonian(), edu.mit.csail.sdg.squander.examples.graph2.Graph.newEdge(), edu.mit.csail.sdg.squander.examples.graph2.Graph.numEdges(), edu.mit.csail.sdg.squander.examples.graph2.Graph.numNodes(), and edu.mit.csail.sdg.squander.examples.graph2.Graph.topsort().
void edu.mit.csail.sdg.squander.examples.graph2.GraphTest.testGraph2 | ( | ) |
Definition at line 65 of file GraphTest.java.
References edu.mit.csail.sdg.squander.examples.graph2.Graph.addNode(), edu.mit.csail.sdg.squander.examples.graph2.Graph.maxClique(), edu.mit.csail.sdg.squander.examples.graph2.Graph.newEdge(), and edu.mit.csail.sdg.squander.examples.graph2.Graph.numEdges().