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...
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | article |
| Lenguaje: | EN FR |
| Publicado: |
EDP Sciences
2021
|
| Materias: | |
| Acceso en línea: | https://doaj.org/article/34fe60abc88f475e863bbb3d8d87d952 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| Sumario: | 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 independent in nature which will facilitate and improve path creation. Based on the results of the application system trials that have been carried out in testing and comparisons between the Kruskal algorithm and the Dijkstra algorithm, the following conclusions can be drawn: that a strength that is the existence of weight sorting will facilitate the search for the shortest path. And considering the characteristics of Kruskal’s independent algorithm, it will facilitate and improve the formation of the path. The weakness of the Kruskal algorithm is that if the number of nodes is very large, it will be slower than Dijkstra’s algorithm because it has to sort thousands of vertices first, then form a path. |
|---|