[[Graph and Networking Algoriithms]] [[Kruskal's Algorithm]]
Prim's algorithm Used for minimum spanning tree edge weights. Uses an array/list to keep track of the visited nodes. In the end the sum of the edges is the minimum possible.
![[prims-algorithm-java.png]]
#algorithms #networking #minimaledgesum #MST