This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Remark : The Dijkstra’s algorithm provides a solution to the problem using a graph with positive weights. • The project requirements – Implement a graph data structure using a collection of adjacency lists such as it is represented in the textbook, see the Figure 13.4, p. 603. You may use the C++ standard library classes, std::vector or std::list , when you work with arrays or linked lists, respectively. At least the following graph operations should be included: * inserting a new edge or a vertex: addEdge and addVertex. * getting a list of all vertices. * finding a vertex adjacent to a given one. – Implement a minimum priority queue represented as a minimum binary heap; reuse your code from the programming assignment #5. You can choose one of these options: * a minimum binary heap without locator (90% of the maximum score) * a minimum binary heap with locator (100% of the maximum score) – Implement the Dijkstra’s algorithm using both the data structures: graph and minimum priority queue. • The input output requirements – Create a graph to be loaded from a user-defined data file. Use the following file format. (Here field descriptions areCreate a graph to be loaded from a user-defined data file....
View Full Document
- Winter '09
- Graph Theory, Dijkstra, Priority queue, minimum binary heap