The Gateway to Computer Science Excellence

DFS- Depth First Search

+1 vote
126 views

in Algorithms by (449 points) | 126 views
+1
c should be answer
by Active (3.1k points)
0
can you explain?
by (449 points)
0
Can you please explain..
by Active (4.7k points)

1 Answer

+2 votes
V6(3,8) V3(1,7) V7(8) V8(4,5) V5(2) V2(1,4) V4() V1()    

because it is DFS use the stack. in bracket i have put the node adjacent to the vertex.

by Active (3.1k points)
0
I think there is something wrong with this solution Plz Cross check.. Because initially while accessing 6 you have inserted 3 and 8 it means they are visited according to algorithm.. You cannot again push 8 while accessing 7 even you can't pop 8 until the above elements are not popped
by Active (3.6k points)
← Prev. Qn. in Sub. Next Qn. in Sub. →
← Prev. Next →

Related questions

+2 votes
0 answers
1
DFS- depth first search
asked Jan 25, 2018 in DS by budhu (139 points) | 121 views
0 votes
0 answers
4
Depth First Search
asked Nov 7, 2018 in Programming by Na462 Loyal (7k points) | 190 views
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,316 answers
198,360 comments
105,087 users