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

4. Dijkstra’s algorithm starts search from the source vertex and keeps finding vertices that have the
shortest path to the source until all vertices are found.
Quiz
Do the quiz for this chapter online at www.cs.armstrong.edu/liang/cpp3e/quiz.html.
Programming Exercises
25.1* (Kruskal’s algorithm) The text introduced Prim’s algorithm for finding a minimum spanning tree.
Kruskal’s algorithm is another well-known algorithm for finding a minimum spanning
tree. The algorithm repeatedly finds a minimum-weight edge and adds it to the tree if it
does not cause a cycle. The process ends when all vertices are in the tree. Design and
implement an algorithm for finding a MST using Kruskal’s algorithm.
25.2* (Implement Prim’s algorithm using adjacency matrix) The text implements Prim’s algorithm using
priority queues on adjacent edges. Implement the algorithm using adjacency matrix for
weighted graphs.
25.3* (Implement Dijkstra’s algorithm using adjacency matrix) The text implements Dijkstra’s algorithm
using priority queues on adjacent edges. Implement the algorithm using adjacency matrix
for weighted graphs.
25.4* (Modify weight in the nine tail problem) In the text, we assign the number of the flips as the weight
for each move. Assuming that the weight is three times the number of flips, revise the
program.
45