For shortest path problems, nodes represent cities (or points) and the edges represent the connectivity, or connection, from one node to another, as illustrated below. These types of problems may have one or more source nodes from which paths are determined. This problem can be both represented using either directed or undirected graphs.

Time for another review question!