Minimum Spanning Tree (MST) in JavaScript



A minimum spanning tree (MST) or minimum weight spanning tree is a subset of the edges of a connected, edge-weighted (un)directed graph that connects all the vertices together, without any cycles and with the minimum possible total edge weight. That is, it is a spanning tree whose sum of edge weights is as small as possible.

Updated on: 2020-06-15T12:10:17+05:30

579 Views

Kickstart Your Career

Get certified by completing the course

Get Started
Advertisements