Ask your own question, for FREE!
Mathematics 7 Online
OpenStudy (anonymous):

How do I implement Depth First Search (Graph search) in Python?

OpenStudy (anonymous):

not math again :P

OpenStudy (anonymous):

I just want to know the details of the implementation.

OpenStudy (anonymous):

lmgtfy.com/?q=depth+first+search+python+code

OpenStudy (anonymous):

what data structure is best to represent the frontier, the explored nodes, etc.

OpenStudy (anonymous):

I've tried google, but I was hoping that some Python guru was here who could show me how to properly do it

OpenStudy (anonymous):

all python gurus are in CS section :D

OpenStudy (anonymous):

for Depth first search, I'm convinced that the frontier is best represented as a stack.

OpenStudy (anonymous):

use a fibonacci heap

OpenStudy (anonymous):

i have no idea what that is but it sounds cool

OpenStudy (anonymous):

lol

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!