Minimal Spanning Trees and Kruskal’s Algorithm
Given a weighted graph G, it is often desired to generate a spanning tree such that the sum of the weights of the tree edges...
Depth First and Breadth First Traversal
Depth first traversal of a Graph could be used to traverse a directed or un-directed graph and thus creating a spanning tree. Depth first traversal...