Home · Unit 4 · Topic 3 · Planar graphs, paths and cycles

Planar graphs, paths and cycles

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 →

Request an applet

Describe the interactive you’d like — same inbox as applet feedback, tagged as a request for this syllabus id.