RecallWeave · original graph course

Minimum spanning forests,
one edge at a time.

Choose the cheapest cycle-free connections that span every original connected component. Follow Kruskal’s choices, keep isolated vertices visible, and see why some links must be rejected.

A minimum spanning tree minimizes the total chosen edge weight. It does not generally preserve every shortest route. If the input is disconnected, the result is a forest.

1. Enter your graph

Vertices are named A onward, up to H. A vertex with no edge remains in the graph.

Undirected, simple graph: no self-loops and no repeated unordered pair. Negative and zero weights are valid.

Use A B -3: two vertex letters and an integer from −99 to 99, separated by spaces or tabs. Blank lines are allowed. A–B and B–A are the same unordered pair.

Editing either input retires the previous trace.

Ready to inspect the choices?

Build a trace to begin with every vertex in its own component.

2. Keep the trace, then study the ideas

Save this exact inspection

The trace download includes the original entered text, the selected decision and the full sequence of immutable snapshots. It is an algorithm record, separate from learner answers.

No automatic storage or upload occurs. The page works directly from your files without a server or connection.

Use the original twelve-question course

  1. Download the course JSON below.
  2. Open RecallWeave and choose it under Bring your own lesson.
  3. Inspect the preview, then choose Start this deck.

The worked guide supplies explanations and transfer prompts. The learning estimate is a model state, not a grade.