Unit 8. Graphs

Graphs are a broad category of data structures. There are five programming assignments for this unit. The first three are rather straight-forward. The fourth problem is challenging and the fifth is optional and very challenging.  All are in CodingRooms.

• 8.01. Complete the Graph constructor and its toString method.

• 8.02. Complete the addEdge  method in the Graph class.

• 8.03. Complete the findDistance method in the Graph class.

• 8.04 Complete three methods the Graph class:  getShortestDistance,  getNodeWithLowestDistance, and  updateUnsettled.  Together these methods implement Dijkstra's algorithm and find the shortest distances from a given vertex to all the other nodes in the graph.

• 8.05 Complete the getBestPath method in the Graph class which returns a List of the nodes that form the shortest path from the first node to the last node. This is an optional assignment.