Subscribe to:
Post Comments (Atom)
-
Graph traversal is a technique used for a searching vertex in a graph. The graph traversal is also used to decide the order of vertices is... -
BFS (Breadth First Search) BFS traversal of a graph produces a spanning tree as final result. Spanning Tree is a graph without loops. We u... -
What is a Spanning Tree? Given an undirected and connected graph , a spanning tree of the graph is a tree that spans (that is, it inclu...
No comments:
Post a Comment