This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: 2 • Report In addition to the regular programming assignment report you should include answers to the following problems. 1. Write about the running time of the Dijkstra’s algorithm related to your implementation of Graph and Priority-Queue ADT. Use the big-O notation to express the running time in order to compare performance of the implementation of the Dijkstra’s algorithm with the most efficient complexity of this algorithm. 2. Discuss the implementation of the Dijkstra’s algorithm related to the representation of the Priority Queue ADT with and without locator. What is the impact of implementing the Priority Queue with locator on the complexity of the Dijkstra’s algorithm? Use the big-O notation to express the running time in each case. 3. Write about how you used the Priority Queue ADT to simplify coding and obtaining the most efficient implementation of the Dijkstra’s algorithm if it applies to your implementation. 4. Test the Dijkstra’s algorithm on different graphs. In your report, find a solution for each graph by hand and provide computational results. 5. Write about three real-life applications where you can use the Dijkstra’s algorithm....
View Full Document
- Winter '09
- Graph Theory, Dijkstra, Priority queue, minimum binary heap