Unformatted text preview: 1. Show the tree (without showing the process of ±nding it). 2. Modify the edge weights so that the two algorithms produce two di²erent trees. The edge weights should be distinct after modiFcation. Show the trees produced. (Hint: You can do this by changing the weight of one edge.) s a b c d 7 2 3 8 9 6 5 1 Notes : You can discuss homework question with your classmates, but you must write up your answers independently. Acknowledge the people with whom you have discussed the assignment. 1...
View
Full Document
 Spring '07
 ARYA
 Algorithms, Graph Theory, Dijkstra, Hong Kong University, shortest path algorithm

Click to edit the document details