package edu.uci.ics.jung.algorithms.shortestpath;
import junit.framework.TestCase;
import edu.uci.ics.jung.graph.DirectedGraph;
import edu.uci.ics.jung.graph.DirectedSparseMultigraph;
import edu.uci.ics.jung.graph.DelegateTree;
import edu.uci.ics.jung.graph.Tree;
import edu.uci.ics.jung.graph.UndirectedGraph;
import edu.uci.ics.jung.graph.UndirectedSparseMultigraph;
public class TestPrimMinimumSpanningTree extends TestCase {
public void testSimpleTree() {
Tree tree = new DelegateTree();
tree.addVertex("A");
tree.addEdge(0,"A","B0");
tree.addEdge(1,"A","B1");
// System.err.println("tree = "+tree);
PrimMinimumSpanningTree pmst =
new PrimMinimumSpanningTree(DelegateTree.getFactory());
// Graph mst =
pmst.apply(tree);
// System.err.println("mst = "+mst);
// assertEquals(tree.getVertices(), mst.getVertices());
// assertEquals(tree.getEdges(), mst.getEdges());
}
public void testDAG() {
DirectedGraph graph = new DirectedSparseMultigraph();
graph.addVertex("B0");
graph.addEdge(0, "A", "B0");
graph.addEdge(1, "A", "B1");
// System.err.println("graph = "+graph);
PrimMinimumSpanningTree pmst =
new PrimMinimumSpanningTree(DelegateTree.getFactory());
// Graph mst =
pmst.apply(graph);
// System.err.println("mst = "+mst);
}
public void testUAG() {
UndirectedGraph graph = new UndirectedSparseMultigraph();
graph.addVertex("B0");
graph.addEdge(0, "A", "B0");
graph.addEdge(1, "A", "B1");
// System.err.println("graph = "+graph);
PrimMinimumSpanningTree pmst =
new PrimMinimumSpanningTree(DelegateTree.getFactory());
// Graph mst =
pmst.apply(graph);
// System.err.println("mst = "+mst);
}
}
Ads help maintain this website.