DSA
Connecting every node in a graph at the lowest total cost with Prim's and Kruskal's algorithms.
The Minimum Spanning Tree (MST) is the collection of edges required to connect all vertices in an undirected graph, with the minimum total edge weight.
Prim's algorithm was invented in 1930 by the Czech mathematician Vojtěch Jarník.
Kruskal's algorithm finds the Minimum Spanning Tree (MST), or Minimum Spanning Forest, in an undirected graph.