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

13 "Atlanta", "Miami", "Dallas", "Houston"};
14
15 // Edge array for graph in Figure 25.1
16 int edges[][3] = {
17 {0, 1, 807}, {0, 3, 1331}, {0, 5, 2097},
18 {1, 0, 807}, {1, 2, 381}, {1, 3, 1267},
19 {2, 1, 381}, {2, 3, 1015}, {2, 4, 1663}, {2, 10, 1435},
20 {3, 0, 1331}, {3, 1, 1267}, {3, 2, 1015}, {3, 4, 599},
21 {3, 5, 1003},
22 {4, 2, 1663}, {4, 3, 599}, {4, 5, 533}, {4, 7, 1260},
23 {4, 8, 864}, {4, 10, 496},
24 {5, 0, 2097}, {5, 3, 1003}, {5, 4, 533},
25 {5, 6, 983}, {5, 7, 787},
26 {6, 5, 983}, {6, 7, 214},
27 {7, 4, 1260}, {7, 5, 787}, {7, 6, 214}, {7, 8, 888},
28 {8, 4, 864}, {8, 7, 888}, {8, 9, 661},
29 {8, 10, 781}, {8, 11, 810},
30 {9, 8, 661}, {9, 11, 1187},
31 {10, 2, 1435}, {10, 4, 496}, {10, 8, 781}, {10, 11, 239},
32 {11, 8, 810}, {11, 9, 1187}, {11, 10, 239}
33 };
34
35 // 23 undirected edges in Figure 25.1
36 const int NUMBER_OF_EDGES = 46;
37
38 // Create a vector for vertices
39 vector vectorOfVertices(12);
40 copy(vertices, vertices + 12, vectorOfVertices.begin());
41
42 // Create a vector for edges
43 vector edgeVector;
44 for (int i = 0; i < NUMBER_OF_EDGES; i++)
45 edgeVector.push_back(WeightedEdge(edges[i][0],
46 edges[i][1], edges[i][2]));
47
48 WeightedGraph graph1(vectorOfVertices, edgeVector);
49 cout