CHAPTER 25 Weighted Graphs and Applications Objectives â¢ To ...

More documents

Recommendations

Info

2097 (edges[2][2]). To create a WeightedGraph, you have to obtain a vector of WeightedEdge (lines 41–44). Line 52 invokes the printWeightedEdges() function on graph1 to display all edges in graph1. The program creates a WeightedGraph graph2 for the graph in Figure 25.3 in lines 55–71. Line 75 invokes the printWeightedEdges() function on graph2 to display all edges in graph2. Check point 25.3 What is the output of the following code? vector list; list.push_back(WeightedEdge(1, 2, 3.5)); list.push_back(WeightedEdge(1, 6, 6.5)); list.push_back(WeightedEdge(1, 7, 1.5)); cout
vector neighbors; neighbors[0].push_back(WeightedEdge(0, 2, 3.5)); neighbors[0].push_back(WeightedEdge(0, 6, 6.5)); neighbors[0].push_back(WeightedEdge(0, 7, 1.5)); neighbors[1].push_back(WeightedEdge(1, 0, 3.5)); neighbors[1].push_back(WeightedEdge(1, 5, 8.5)); neighbors[1].push_back(WeightedEdge(1, 8, 19.5)); cout
Page 1 and 2: CHAPTER 25 Weighted Graphs and Appl
Page 3 and 4: acquainted with weighted graphs usi
Page 5 and 6: 7 { 8 public: 9 double weight; // T
Page 7 and 8: Graph Defined in Figure 24.7. Weigh
Page 9 and 10: 72 for (unsigned i = 0; i < edges.s
Page 11 and 12: 189 u = i; 190 } 191 } 192 193 if (
Page 13: 72 edges2[i][1], edges2[i][2])); 73
Page 17 and 18: 10 Add u to T; 11 for (each v not i
Page 19 and 20: 1 10 2 cost 0 9 5 9 7 5 8 T 0 1 2 3
Page 21 and 22: (g) NOTE: A minimum spanning tree i
Page 23 and 24: The MST class extends the Tree clas
Page 25 and 26: 81 vector edgeVector2; 82 for (int
Page 27 and 28: 25.5 Finding Shortest Paths The sh
Page 29 and 30: (a) Before moving u to T (b) After
Page 31 and 32: Now T contains {1, 2, 0}. Vertex 6
Page 33 and 34: As you see, the algorithm essential
Page 35 and 36: priority queues, we can implement t
Page 37 and 38: 57 const int NUMBER_OF_EDGES = 46;
Page 39 and 40: 25.12 What happens to the getShorte
Page 41 and 42: and flipACell(&node, row, column) d
Page 43 and 44: The getNumberOfFlips(int u) functio
Page 45 and 46: 4. Dijkstra’s algorithm starts se
Page 47 and 48: The vertices and edges of a weighte
Page 49 and 50: Input: a weighted graph G = (V, E)

CHAPTER 25 Weighted Graphs and Applications Objectives â¢ To ...

Create successful ePaper yourself

Delete template?

Save as template?

CHAPTER 25 Weighted Graphs and Applications Objectives â¢ To ...