Spanning Tree and Minimum Spanning Tree
In this tutorial, you will learn about spanning tree and minimum spanning tree with help of examples and figures. Before we learn about spanning trees, […]
spanning tree
Second best Minimum Spanning Tree – Using Kruskal and Lowest Common Ancestor
A Minimum Spanning Tree $T$ is a tree for the given graph $G$ which spans over all vertices of the given graph and has the […]
Minimum spanning tree – Kruskal with Disjoint Set Union
For an explanation of the MST problem and the Kruskal algorithm, first see the main article on Kruskal’s algorithm. In this article we will consider the […]
Minimum spanning tree – Kruskal’s algorithm
Given a weighted undirected graph. We want to find a subtree of this graph which connects all vertices (i.e. it is a spanning tree) and […]
