Minimum spanning tree on an undirected, weighted graph. Toggle between Parallel Fill (edges fill from the middle, sorted by weight) and a basic Step Mode.
V and edges E,
then E lines each holding an undirected edge u v weight.
Vertices are 0 … V−1. Weights are positive numbers (decimals ok).
V more lines of
x y — one pair per vertex, in order — to pin down your own layout instead of the
automatic one. Any numeric scale works; it's auto-centred and scaled to fit, preserving relative
position and aspect ratio. Loading a graph always fills the box back in with its current layout's
coordinates so you can nudge them; tick the box above to see the plain format instead.