True false explain 4 let p be a shortest path from

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

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 efficient than ordinary BFS? 2. What is the running time of the most efficient deterministic algorithm you know for finding the shortest path between two vertices in a directed graph, where the weights of all edges are...
View Full Document

This note was uploaded on 09/24/2010 for the course CS 6.006 taught by Professor Erikdemaine during the Spring '08 term at MIT.

Ask a homework question - tutors are online