CHAPTER 25 Weighted Graphs and Applications Objectives • To ...

8
13 // Construct an empty graph
14 WeightedGraph();
15
16 // Construct a graph from vertices and edges objects
17 WeightedGraph(vector& vertices, vector& edges);
18
19 // Construct a graph with vertices 0, 1, ..., n-1 and
20 // edges in a vector
21 WeightedGraph(int numberOfVertices, vector& edges);
22
23 // Print all edges in the weighted tree
24 void WeightedGraph::printWeightedEdges();
25
26 // Add a weighted edge
27 bool addEdge(int u, int v, double w);
28
29 // Get a minimum spanning tree rooted at vertex 0
30 MST getMinimumSpanningTree();
31
32 // Get a minimum spanning tree rooted at a specified vertex
33 MST getMinimumSpanningTree(int startingVertex);
34
35 // Find single-source shortest paths
36 ShortestPathTree getShortestPath(int sourceVertex);
37 };
38
39 const int INFINITY = 2147483647;
40
41 template
42 WeightedGraph::WeightedGraph()
43 {
44 }
45
46 template
47 WeightedGraph::WeightedGraph(vector& vertices,
48 vector& edges)
49 {
50 // Add vertices to the graph
51 for (unsigned i = 0; i < vertices.size(); i++)
52 {
53 addVertex(vertices[i]);
54 }
55
56 // Add edges to the graph
57 for (unsigned i = 0; i < edges.size(); i++)
58 {
59 addEdge(edges[i].u, edges[i].v, edges[i].weight);
60 }
61 }
62
63 template
64 WeightedGraph::WeightedGraph(int numberOfVertices,
65 vector& edges)
66 {
67 // Add vertices to the graph
68 for (int i = 0; i < numberOfVertices; i++)
69 addVertex(i); // vertices is {0, 1, 2, ..., n-1}
70
71 // Add edges to the graph