Kruskal's Algorithm | Minimum Spanning Tree | Greedy Approach | Data Structure
Kruskal's algorithm is a minimum-spanning-tree algorithm which 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.
Minimum Spanning Tree: • Minimum Spanning Tree (Data Structure)
Prim's Algorithm: • Prim's Algorithm for Minimum Spanning Tree...