Coding Byte

Graphs: Understanding Kruskal’s Algorithm

What is Kruskal’s algorithm? Kruskal’s algorithm is used to find a minimum spanning forest or tree in an undirected graphs and connected graphs respectively. For graphs, minimum spanning trees are a subset of edges that form a tree which include all vertices, where the sum of all edges is kept to the smallest number possible. […]