Algorithms and Data Structures II
- Insertion Sort
- Merge Sort
- Binary Heap implementation
Undirected Graph ADT
Extend Graph with methods for Depth-First and Breadth-First Searches, and finding the most central vertex.
- Adaptable Priority Queue with a Binary Heap
- Dijkstra's Algorithm for finding shortest paths in a Graph
- Extend the Graph to work with Route Maps to find the shortest paths between locations.