Prim algorithm based on adjacency list
Prim algorithm
Prim algorithm is an algorithm to find the minimum spanning tree (mst) through the connected network Process: 1. Firstly, select any vertex as the root of the tree 2. Traverse other vertices (not in the tree). For each vertex, find an edge with the shortest path to mst. In this way, each vertex has an edge to mst (if it is not a ...
Added by Gestahr on Tue, 08 Feb 2022 01:47:12 +0200