Minimum Spanning Tree Tutorials & Notes | Algorithms | HackerEarth
Data Structures & Algorithms in Kotlin, Chapter 23: Prim's Algorithm | raywenderlich.com
prim's algorithm
10.2 Minimum Spanning Tree: Prim's Algorithm A spanning tree of an undirected graph G is a subgraph of G that is a tree containing all the vertices of G. In a weighted graph, the weight of a subgraph is the sum of the weights of the edges in the subgraph. A ...