CSCI 2300 Lab 6 Fall 2011, 10/19/11

1. The BFS procedure is already described in the above code. Modify the code to make it (shortest path algorithm) work on a weighted directed graph (i.e., edges have weights) You can use Priority queue from STL. Output will be the shortest path froma given source to a given destination. Test it with data6
2. Modify the above code to produce minimum spannig tree of an undirected graph. Out put will be the minimum spanning tree edges. Test it with data62