Kruskal Algo
This document was uploaded by user and they confirmed that they have the permission to share it. If you are author or own the copyright of this book, please report to us by using this DMCA report form. Report DMCA
Overview
Download & View Kruskal Algo as PDF for free.
More details
- Words: 57
- Pages: 1
Kruskal's Algorithm
In kruskal's algorithm the selection function chooses edges in increasing order of length without worrying too much about their connection to previously chosen edges, except that never to form a cycle. The result is a forest of trees that grows until all the trees in a forest (all the components) merge in a single tree.
In kruskal's algorithm the selection function chooses edges in increasing order of length without worrying too much about their connection to previously chosen edges, except that never to form a cycle. The result is a forest of trees that grows until all the trees in a forest (all the components) merge in a single tree.
Related Documents
Kruskal Algo
November 2019 7
Algo
June 2020 24
Algo+
June 2020 27
Algo
December 2019 45
Algo
June 2020 26