h f bo
Draw the Depth First Search Tree of the following graph and Infer the bi-connected components of the graph.
Depth First Search(DFS):
- It is Uniformed search technique.
- It works on Stack(LIFO).
- It works on Deepest node of the tree.
- There are Infinite loop exist.
STEPS:
Let start with vertex c.
steps1.lable vertex c and do dfs from either e or b,suppose the vertex b is selected.
step2.label b and do dfs from either a,f,d, suppose a is selected.
step3.label d and do dfs from either g,b we take g.
step4.label g and do dfs from either a,f as a is already in the stack we take f.
step5.label f and do dfs b,i,h, we take h.
step6.label h and do dfs from either f,i,we take i.
step7.label i and do dfs from either f,j
step8.label j and pop out as ther is no more adjecent visited nodes.
step9.back tracking to i then from h,f,b. from b we take d.
step10.label d after back tracking.
step11 label e.
DFS=c,b,a,g,f,h,i,j,d,e.
Step by step
Solved in 4 steps with 2 images
