Weighted graphs and shortest path – Dijkstra's algorithm

MathematicsSets, Logic & Graph TheoryAges 16–17

A map of locations is modeled as a graph: vertices are places, edges are roads, and weights are distances in kilometers. Choose a start vertex and an end vertex, then step through Dijkstra's algorithm: assign temporary labels, fix the vertex with the smallest label, and update its neighbors. Click an edge to change its length (a detour or a closed road) and watch the shortest path change, along with vertex degrees and the condition for an Eulerian circuit.