In many cases it may be useful to determine the shortest path between two vertices of a graph. For example, for a graph representing the road network interconnecting several towns, we may want to find the fastest way of getting from one town to another.
The shortest path between two vertices is the path with the least weight.
The weight of a path is found by summing the weights of each edge making up that path.
Shortest Path by Inspection
Finding the shortest path via inspection involves a crude trial and error approach whereby multiple possible paths are tested until the shortest is found.
This content is for Master Notes FM members only. Unlock the content by signing up for a membership level - quick and easy! Log InSign Up