The Implementation of Kruskal’s Algorithm for Minimum Spanning Tree in a Graph
Kruskal’s Algorithm is an algorithm used to find the minimum spanning tree in graphical connectivity that provides the option to continue processing the least-weighted margins. In the Kruskal algorithm, ordering the weight of the ribs makes it easy to find the shortest path. This algorithm is indepe...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | article |
| Language: | EN FR |
| Published: |
EDP Sciences
2021
|
| Subjects: | |
| Online Access: | https://doaj.org/article/34fe60abc88f475e863bbb3d8d87d952 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!