TransportationSystem/test_Dijkstra.cpp at master · ChineseAegis/TransportationSystem · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
#include "catch.hpp"
#include"WUSGraphClient.hpp"
#include"WUSGraph.hpp"
#include"Tree.hpp"
#include"Forest.hpp"
TEST_CASE("Dijkstra", "[Dijkstra]")
{
	WUSGraph<int, int> graph;
	WUSGraphClient<int, int> c;
	graph.addVertex(1);
	graph.addVertex(2);
	graph.addVertex(3);
	graph.addVertex(4);
	graph.addVertex(5);
	graph.addEdge(1, 2, 10);
	graph.addEdge(2, 3, 20);
	graph.addEdge(1, 3, 20);
	graph.addEdge(2, 4, 5);
	graph.addEdge(3, 5, 10);
	graph.addEdge(4, 5, 5);
	graph.addEdge(2, 5, 5);
	//REQUIRE(graph.vertexCount() == 3);
	int i = 1;
	//c.Dijkstra(graph,i);
	//c.Prim(graph);
}
TEST_CASE("Dijkstra and Prim - Complex Graph", "[Graph Algorithms]") {
    WUSGraph<int, int> graph;
    WUSGraphClient<int, int> c;

    // 添加顶点
    graph.addVertex(1);
    graph.addVertex(2);
    graph.addVertex(3);
    graph.addVertex(4);
    graph.addVertex(5);
    graph.addVertex(6);
    graph.addVertex(7);
    graph.addVertex(8);
    graph.addVertex(9);

    // 添加边
    graph.addEdge(1, 2, 4);
    graph.addEdge(1, 3, 1);
    graph.addEdge(2, 3, 2);
    graph.addEdge(2, 4, 5);
    graph.addEdge(3, 4, 8);
    graph.addEdge(3, 5, 10);
    graph.addEdge(4, 5, 2);
    graph.addEdge(5, 6, 1);
    graph.addEdge(6, 7, 7);
    graph.addEdge(7, 8, 6);
    graph.addEdge(8, 9, 12);
    graph.addEdge(7, 9, 5);
    graph.addEdge(5, 9, 8);

    // 运行算法
    int start_vertex = 1;
    Tree<int, int> t;
    Forest<int,int> f;
    c.Prim(graph,f);
    f.printWholeForest();
    c.Dijkstra(graph, start_vertex, t);
    t.printWholeTree();
    // 可以添加一些 REQUIRE 语句来验证算法的正确性
}