github
/
developer-roadmap
mirror of https://github.com/kamranahmedse/developer-roadmap.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity
Roadmap to becoming a developer in 2022
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
4019 Commits
223 Branches
4 Tags
438 MiB
 
 
 
 
 
Tag: Branch: Tree: f8e5833f6a
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from 'f8e5833f6a'
${ noResults }
developer-roadmap/src/data/roadmaps/datastructures-and-algorithms/content/108-graph-data-structure/104-minimum-spanning-tree/index.md

549 B
Raw Blame History

Minimum Spanning Tree

A Minimum Spanning Tree (MST) is a concept in graph theory where it represents a subset of the edges of a connected, undirected graph. This subset connects all the vertices together, without any cycles and with the minimum possible total edge weight. There are quite a few algorithms that can be used to find the MST of a graph such as Prim's, Kruskal's, and Boruvka's algorithm. The concept is important in network design, where the goal is to minimize the total length of the wires yet still connect all of the points.