public void TestMinimumSpanningTreeDirectedGraph()
{
IGraph graph = new Graph(true);
graph.AddNode(new Node("1"));
graph.AddNode(new Node("2"));
graph.AddNode(new Node("3"));
graph.AddNode(new Node("4"));
graph.AddNode(new Node("5"));
graph.AddNode(new Node("6"));
graph.AddNode(new Node("7"));
graph.AddNode(new Node("8"));
graph.BuildEdge("1", "2", 18);
graph.BuildEdge("1", "7", 10);
graph.BuildEdge("2", "8", 7);
graph.BuildEdge("2", "6", 11);
graph.BuildEdge("3", "1", 2);
graph.BuildEdge("3", "4", 6);
graph.BuildEdge("3", "6", 21);
graph.BuildEdge("5", "1", 5);
graph.BuildEdge("5", "2", 4);
graph.BuildEdge("6", "1", 19);
graph.BuildEdge("7", "3", 17);
graph.BuildEdge("7", "4", 3);
graph.BuildEdge("7", "5", 3);
graph.BuildEdge("8", "6", 9);
MinimumSpanningTree mst = new MinimumSpanningTree(graph);
WeightedTraversalResult result = mst.Run();
Assert.Equal(33, result.TotalWeight);
Assert.Equal("3,1,7,4,5,2,8,6", string.Join(",", result.Nodes.Select(node => node.ID)));
}
public void TestMinimumSpanningTreeUndirectedGraph()
{
IGraph graph = new Graph();
graph.AddNode(new Node("1"));
graph.AddNode(new Node("2"));
graph.AddNode(new Node("3"));
graph.AddNode(new Node("4"));
graph.AddNode(new Node("5"));
graph.BuildEdge("1", "2", 8);
graph.BuildEdge("1", "3", 4);
graph.BuildEdge("1", "4", 2);
graph.BuildEdge("1", "5", 3);
graph.BuildEdge("2", "4", 15);
graph.BuildEdge("2", "3", 9);
graph.BuildEdge("3", "4", 10);
graph.BuildEdge("3", "5", 7);
graph.BuildEdge("4", "5", 9);
MinimumSpanningTree mst = new MinimumSpanningTree(graph);
WeightedTraversalResult result = mst.Run();
Assert.Equal("1,4,5,3,2", string.Join(",", result.Nodes.Select(node => node.ID)));
Assert.Equal(17, result.TotalWeight);
}