WEIGHTED GRAPHS
Prim (minimum spanning tree)
Bellman-Ford (shortest paths)
Dijkstra (shortest paths)
Lecture graph, 7 vertices (undirected)
Lecture graph, S to D (directed, one negative edge)
Seven Oregon towns, road miles
EV from Portland to Bend, net kWh
Activity: Willamette Valley fiber co-op
Activity: Mount Hood shuttle
Activity: Mount Hood shuttle with the regenerative descent (R to T = -4)
Custom
Edit graph
Reset
← Back
Step →
Play
EDGES (A-B:4 undirected, A->B:-2 directed, separated by commas or spaces)
Apply
Vertices are laid out on a circle; drag them to rearrange.
CODE