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

***25.11 (Test if a vertex in T effeciently) Since T is implemented using a list in the
getMinimumSpanningTree and getShortestPath functions in Listing 25.2
WeightedGraph.cpp, testing whethere a vertex u is in T by invoking the STL find
algorithm takes O(n) time. Modify these two functions by introducing an array named
isInT. Set isInT[u] to true when a vertex u is added to T. Testing whethere a vertex
u is in T can now be done in O(1) time. Write a test program using following code, where
graph1, printTree, and printAllPath are the same as in Listings 25.6 and 25.9:
WeightedGraph graph1(vectorOfVertices, edgeVector);
MST tree1 = graph1.getMinimumSpanningTree();
cout