Kruskal's Algorithm: Difference between revisions
Jump to navigation
Jump to search
| Line 9: | Line 9: | ||
=Overview= | =Overview= | ||
Kruskal's algorithms is a greedy algorithm that computes the [[The Minimum Spanning Tree Problem|minimum cost spanning tree]] for an undirected connected graph. It has a different approach than [[Prim%27s_Algorithm#Overview|Prim's algorithm]] | Kruskal's algorithms is a greedy algorithm that computes the [[The Minimum Spanning Tree Problem|minimum cost spanning tree]] for an undirected connected graph. It has a different approach than [[Prim%27s_Algorithm#Overview|Prim's algorithm]], in that it does not grow the connected explored territory one node at a time, but it grows the trees in parallel with a lot of simultaneous little pieces, unconnected at first, which eventually merge into the minimum cost spanning tree. | ||
=Non-Optimized Implementation= | =Non-Optimized Implementation= | ||
Revision as of 16:54, 22 October 2021
External
Internal
Overview
Kruskal's algorithms is a greedy algorithm that computes the minimum cost spanning tree for an undirected connected graph. It has a different approach than Prim's algorithm, in that it does not grow the connected explored territory one node at a time, but it grows the trees in parallel with a lot of simultaneous little pieces, unconnected at first, which eventually merge into the minimum cost spanning tree.