Kruskal’s algorithm is an algorithm used to find a minimum spanning tree in graph connectivity which gives an option to keep processing the edge limit with the least weight. In a Kruskal’s algorithm, the weight sorting of edge value will ease the finding of the shortest path. This algorithm has independent nature which will ease and enhance the path track making.
R. Johnsonbaugh, Discrete Mathematics, Seventh. Pearson Prentice Hall, 2009.
G. Brassard and P. Bratley, Fundamental of Algorithmics. Pearson, 1995.
B. R. Preiss, Data Structures and Algorithms with Object-Oriented Design Patterns in Java. John Wiley & Sons, 1999.
IJID (International Journal on Informatics for Development) is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License