CSC 1300 / Discrete Structures

Minimum spanning tree demo

Graph

Vertices08

512

Algorithm

Grow one tree from a random starting vertex.

Run

READY

Choose the lightest crossing edge.

Start from the highlighted vertex.

Tree edges0 / 7

8 VERTICES 12 EDGES 0 TREE WEIGHT

In tree Next edge Cycle / skipped

Step history

0 steps

Each move will appear here.

Designed for CSC 1300 - Discrete Structures by Maurício Gruppi