Kruskal’s Algorithm produces the disjoint set in the data structure. To maintain several disjoint sets of elements each set contains the vertices in a tree of the current forest. The operation to find set u returns the Q representation element from the set that contains u. Thus we can determine whether two vertices u and […]

Prism Algorithm is a type of greedy algorithm so finding the minimum spanning tree in this algorithm should have the property that edges in a set ($\pi$) always from a single tree that is a tree stats from arbitrary root vertex (R) and grows until the tree spans all the vertices (V). Algorithm With Explanation

A binary tree is considered a 2-tree or an extended binary tree in data structure if each node has either 0 or 2 children. In such a case the nodes with 2 children are called internal nodes and the nodes with zero children are called external nodes. Sometimes the nodes are distinguished in diagrams by

In DFS edges are explored out of the most recently discovered vertex (V) that still has unexplored edges leaving it. When all the V’s edges have been explored the search backtracks to explore edges leaving the vertex from which ‘V’ was discovered. This process continues until we have discovered all the vertices that are reachable

BFS is an easy and simplest algorithm for searching a graph and this algorithm works on both directed and Undirected graph .Many algorithm uses the idea of BFS like prism algorithm and Dijkstra Algorithm. Given a graph G = {V,E} and a distinguished source vertex ‘S’ . BFS Systematically explores the edges of G to