Kruskal's Algorithm using union find
2016-08-23
0 0 0
no vote
Other
Earn points
Kruskal's algorithm is a greedy algorithm in graph theory that finds a minimum spanning tree for a connected weighted graph.
This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the
edges in the tree is minimized. If the graph is not connected, then it finds a minimum spanning forest (a minimum spanning
tree for each connected component).
A union-find algorithm is an algorithm that performs two useful operations on such a data structure:
c++
算法
Kruskal
联盟
使用
查找
Related Source Codes
Local Path Planning Algorithm - DWA Algorithm
0
0
no vote
Classic Interview Questions for Digital City Front
0
0
no vote
enDAQ-Shock-Data-Share-SRS-Blog
0
0
no vote
HDU-2553 N Queen Question
0
0
no vote
Calling chatGPT in a Windows application
0
0
no vote
No comment