How does kruskal algorithm work in computer?
Answers
Answered by
1
Kruskal's algorithm. Kruskal's algorithm is a minimum-spanning-tree algorithmwhich finds an edge of the least possible weight that connects any two trees in the forest. It is a greedy algorithm in graph theory as it finds a minimum spanning tree for a connected weighted graph adding increasing cost arcs at each step.
Similar questions