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...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Paryati, Salahddine Krit
Formato:	article
Lenguaje:	EN FR
Publicado:	EDP Sciences 2021
Materias:	kruskal’s algorithm spanning tree Engineering (General). Civil engineering (General) TA1-2040
Acceso en línea:	https://doaj.org/article/34fe60abc88f475e863bbb3d8d87d952
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:34fe60abc88f475e863bbb3d8d87d952
record_format	dspace
spelling	oai:doaj.org-article:34fe60abc88f475e863bbb3d8d87d9522021-12-02T17:13:38ZThe Implementation of Kruskal’s Algorithm for Minimum Spanning Tree in a Graph2261-236X10.1051/matecconf/202134801001https://doaj.org/article/34fe60abc88f475e863bbb3d8d87d9522021-01-01T00:00:00Zhttps://www.matec-conferences.org/articles/matecconf/pdf/2021/17/matecconf_inbes2021_01001.pdfhttps://doaj.org/toc/2261-236XKruskal’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.ParyatiSalahddine KritEDP Sciencesarticlekruskal’s algorithmspanning treeEngineering (General). Civil engineering (General)TA1-2040ENFRMATEC Web of Conferences, Vol 348, p 01001 (2021)
institution	DOAJ
collection	DOAJ
language	EN FR
topic	kruskal’s algorithm spanning tree Engineering (General). Civil engineering (General) TA1-2040
spellingShingle	kruskal’s algorithm spanning tree Engineering (General). Civil engineering (General) TA1-2040 Paryati Salahddine Krit The Implementation of Kruskal’s Algorithm for Minimum Spanning Tree in a Graph
description	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.
format	article
author	Paryati Salahddine Krit
author_facet	Paryati Salahddine Krit
author_sort	Paryati
title	The Implementation of Kruskal’s Algorithm for Minimum Spanning Tree in a Graph
title_short	The Implementation of Kruskal’s Algorithm for Minimum Spanning Tree in a Graph
title_full	The Implementation of Kruskal’s Algorithm for Minimum Spanning Tree in a Graph
title_fullStr	The Implementation of Kruskal’s Algorithm for Minimum Spanning Tree in a Graph
title_full_unstemmed	The Implementation of Kruskal’s Algorithm for Minimum Spanning Tree in a Graph
title_sort	implementation of kruskal’s algorithm for minimum spanning tree in a graph
publisher	EDP Sciences
publishDate	2021
url	https://doaj.org/article/34fe60abc88f475e863bbb3d8d87d952
work_keys_str_mv	AT paryati theimplementationofkruskalsalgorithmforminimumspanningtreeinagraph AT salahddinekrit theimplementationofkruskalsalgorithmforminimumspanningtreeinagraph AT paryati implementationofkruskalsalgorithmforminimumspanningtreeinagraph AT salahddinekrit implementationofkruskalsalgorithmforminimumspanningtreeinagraph
_version_	1718381312384958464

The Implementation of Kruskal’s Algorithm for Minimum Spanning Tree in a Graph

Ejemplares similares