This preview shows page 1. Sign up to view the full content.
Unformatted text preview: ee. True False Explain: 4. Let P be a shortest path from some vertex s to some other vertex t in a graph. If the weight of each edge in the graph is increased by one, P will still be a shortest path from s to t. True False Explain: 5. If an in-place sorting algorithm is given a sorted array, it will always output an unchanged array. True False Explain: Handout 9: Quiz 2 Practice Problems 6. [5 points] Dijkstra’s algorithm works on any graph without negative weight cycles. True False Explain: 3 7. [5 points] The Relax function never increases any shortest path estimate d[v ]. True False Explain: 4 Handout 9: Quiz 2 Practice Problems 2 Short Answer
1. What property of the Rubik’s cube graph made 2-way BFS more efﬁcient than ordinary BFS? 2. What is the running time of the most efﬁcient deterministic algorithm you know for ﬁnding the shortest path between two vertices in a directed graph, where the weights of all edges are...
View Full Document
- Spring '08