Solve practical problems to determine the shortest path between two vertices in a weighted graph (by trial-and-error methods only).

gm-u4-t3-s2-d5

Interactive

Find the shortest route

manipulative

Trial-and-error paths on a weighted network — fewest edges is not always the lowest total weight.

Open fullscreen →

Want a different take?

Already have one and want another angle on this point? Describe what students should notice. Requests are read and acted on.