WOLFRAM NOTEBOOK

WOLFRAM|DEMONSTRATIONS PROJECT

Greedy Algorithms for a Minimum Spanning Tree

​
problem
dimension
2D
3D
random seed
525
number
40
method
Prim
Kruskal
process
Two greedy algorithms (due to Prim [1] and Kruskal [2]) have been proved to find an optimal spanning tree. This Demostration lets you visualize the two algorithms in either 2D or 3D.
Wolfram Cloud

You are using a browser not supported by the Wolfram Cloud

Supported browsers include recent versions of Chrome, Edge, Firefox and Safari.


I understand and wish to continue anyway »

You are using a browser not supported by the Wolfram Cloud. Supported browsers include recent versions of Chrome, Edge, Firefox and Safari.