Kruskal’s Algorithm

Builds a minimum spanning tree by sorting edges by weight and adding them if they don’t form a cycle.

Category: graph

Enjoy reading code with a tandem explainer?

Explain code with DocComment! Try out your own code!