Thread: searching problem

well, i would like to get ideals and comments from you about codding the breadth-first tree search by using recurion concept.

Check on the Internet. www.google.com may help.

Originally posted by beely
well, i would like to get ideals and comments from you about codding the breadth-first tree search by using recurion concept.

Run that by Google and you'll get a bunch of info on it. For starters, here's something to take a look at.

With BFS, recursion would be an odd way of doing it. Basicly, if I grasp it corretly, BFS means you visit all neighboring nodes, and then you visit all the neighbors of all of those nodes, and so on.

Recursion doesn't really fit that well. DFS and recursion go hand in hand.

Quzah.

thank again,
for more info, is there another way to coding the breadth-first search without recursion concept? so what's the situation should be?

Originally posted by beely
thank again,
for more info, is there another way to coding the breadth-first search without recursion concept? so what's the situation should be?

Read the link that I gave you. Go visit Google. Take two asprin, call me in the morning.

Quzah.

thanks quzah, i will try to find out the ideals. any problem i will reply post to you. thanks anyway.