Kruskal’s Algorithm

Kruskal’s Algorithm
  • Approach: greedy approach
  • Purpose: to find a minimum spanning tree in a weighted graph
Example

 


References

Leave a Reply

Your email address will not be published. Required fields are marked *