Howdy, Stranger!

It looks like you're new here. If you want to get involved, click one of these buttons!

Sign In with Facebook Sign In with Google Sign In with OpenID

Categories

We have migrated to a new platform! Please note that you will need to reset your password to log in (your credentials are still in-tact though). Please contact lee@programmersheaven.com if you have questions.
Welcome to the new platform of Programmer's Heaven! We apologize for the inconvenience caused, if you visited us from a broken link of the previous version. The main reason to move to a new platform is to provide more effective and collaborative experience to you all. Please feel free to experience the new platform and use its exciting features. Contact us for any issue that you need to get clarified. We are more than happy to help you.

help in breadth first search

frozenparatafrozenparata Posts: 33Member
hi guyz,
i have the algorithms for BFS and DFS.Here is mine........
i tried implementing them and error occured.....can someone help me with code

/*Q = new queue
Q.enq(v)
mark v as visited
while Q is not empty ////////BFS
curr = Q.deq()
print curr
for each w in adj(curr)
if w is not visited
Q.enq(w)
mark w as visited*/

/////DFS

s = new stack
s.push(v)
mark v as visited
while s is not empty
curr =s.top()
if every vertex in adj(curr)
is visited
s.pop()
else
let w be an unvisited vertex in adj(curr)
s.push(w)
print and mark w as visited




Sign In or Register to comment.