최소신장트리(2)
-
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 -
3.6.2 Kruskal’s algorithm (크루스칼 알고리즘)
CS - 3. Common Algorithms - 3.6 Greedy Algorithms - 3.6.2 Kruskal's algorithm Kruskal’s algorithm 💡Kruskal’s algorithm is a greedy algorithm that finds a minimum spanning tree for a connected weighted graph. It is a minimum spanning tree algorithm that takes a graph as input and finds the subset of the edges of that graph which form a tree that includes every vertex, where the total weight of al..
2024.02.05