Lab
Graph Minimization
Prelab Task:
1. Reviewed the materials we learned for Short paths and spanning trees
2. Perform minimum path algorithm for graph B
Lab Task:
Read and copy "d_graph.h" and "d_util.h", which will be used in your program
Write a program in a file named lab_11.cpp
it will ask user to input one of the vertices from graph B. For each of the other vertices v in the graph, the program will determine the weight of the minimum path weight.
It will then output the vertex that has the largest minimum-path weight, the weight of the minimum path, and the path itself.
Compare your answers with sample program output
