3.6.4 Prim’s Algorithm (프림 알고리즘)

CS - 3. Common Algorithms - 3.6 Greedy Algorithms - 3.6.4 Prim's algorithm Prim’s Algorithm 💡 Prim’s algorithm is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph. A minimum spanning tree is a subset of the edges of a connected, edge-weighted undirected graph that connects all the vertices together, without any cycles and with the minimum possible total edge ..

2024.02.07