Develop a real world mapping example of your own making. It can map people to people, or place to place, or item to item, or any combination of your choosing.
Develop the code to build and the map using adjacency lists (similar to a hash map).
Develop the code required to determine a path from any one vertices to another. (Later we will add Dijkstra’s algorithm for finding the shortest path)