edu.mit.csail.sdg.squander.examples.graph.GraphTest Class Reference
[Tests]

List of all members.

Public Member Functions
void	testGraph1 ()
void	testGraph2 ()
void	testColor ()
void	testTSP ()
Private Member Functions
boolean	checkColorsOk (Graph g, Map< Node, Integer > colors)

---

Detailed Description

Testing various graph algorithms.

Author:

kuat

Definition at line 26 of file GraphTest.java.

---

Member Function Documentation

boolean edu.mit.csail.sdg.squander.examples.graph.GraphTest.checkColorsOk	(	Graph	g,
		Map< Node, Integer >	colors
	)			[private]

Definition at line 176 of file GraphTest.java.

References edu.mit.csail.sdg.squander.examples.graph.Graph.getNeighbors(), and edu.mit.csail.sdg.squander.examples.graph.Graph.size().

Referenced by edu.mit.csail.sdg.squander.examples.graph.GraphTest.testColor().

void edu.mit.csail.sdg.squander.examples.graph.GraphTest.testColor

(

)

Definition at line 120 of file GraphTest.java.

References edu.mit.csail.sdg.squander.examples.graph.GraphTest.checkColorsOk(), edu.mit.csail.sdg.squander.examples.graph.Graph.color(), edu.mit.csail.sdg.squander.examples.graph.Graph.newEdge(), edu.mit.csail.sdg.squander.examples.graph.Graph.newNode(), and edu.mit.csail.sdg.squander.examples.graph.Graph.newUndirectedEdge().

void edu.mit.csail.sdg.squander.examples.graph.GraphTest.testGraph1

(

)

Definition at line 29 of file GraphTest.java.

References edu.mit.csail.sdg.squander.examples.graph.Graph.addNode(), edu.mit.csail.sdg.squander.examples.graph.Graph.hamiltonian(), edu.mit.csail.sdg.squander.examples.graph.Graph.hamiltonian2(), edu.mit.csail.sdg.squander.examples.graph.Graph.newEdge(), edu.mit.csail.sdg.squander.examples.graph.Graph.numEdges(), edu.mit.csail.sdg.squander.examples.graph.Graph.numNodes(), and edu.mit.csail.sdg.squander.examples.graph.Graph.topsort().

void edu.mit.csail.sdg.squander.examples.graph.GraphTest.testGraph2

(

)

Definition at line 73 of file GraphTest.java.

References edu.mit.csail.sdg.squander.examples.graph.Graph.addNode(), edu.mit.csail.sdg.squander.examples.graph.Graph.maxClique(), edu.mit.csail.sdg.squander.examples.graph.Graph.newEdge(), and edu.mit.csail.sdg.squander.examples.graph.Graph.numEdges().

void edu.mit.csail.sdg.squander.examples.graph.GraphTest.testTSP

(

)

Definition at line 147 of file GraphTest.java.

References edu.mit.csail.sdg.squander.examples.graph.Graph.newNode(), edu.mit.csail.sdg.squander.examples.graph.Graph.newUndirectedEdge(), and edu.mit.csail.sdg.squander.examples.graph.Graph.tsp().

---

The documentation for this class was generated from the following file:

• tests/edu/mit/csail/sdg/squander/examples/graph/GraphTest.java