What is Kruskal's algorithm with example?

Related questions

1. Why is Prims better than Kruskal?
2. What is a Layer 3 address?
3. What are the protocols in data link layer?
4. How does Prims algorithm work?
5. What is the difference between Prim's algorithm and Dijkstra's algorithm?
6. Do TIFF files have layers?
7. Which protocols are used in data link layer?
8. Which is better Prims or Kruskal?
9. What is the use of Huffman coding?
10. What is greedy algorithm example?

Tags

1. #possible
2. #connected
3. #weight
4. #finds
5. #connects
6. #least
7. #which
8. #spanning
9. #minimum
10. #trees
11. #kruskal
12. #algorithm
13. #weighted
14. #forest
15. #adding
16. #theory
17. #greedy
18. #increasing
19. #graph