8 replies to this topic

[toto_7]

I would like to ask, when this algorithm finished, when you put all of the nodes in the tree and the fringe is empty, or when you reach the destination node?

[Momerath]

It ends when all nodes have been visited.

[toto_7]

So, what happened if you can't visit all nodes?

[Momerath]

Well, since it's for a connected graph you'd have some issues now, wouldn't you.

[toto_7]

The problem is that, node "A" goes to 3 different nodes, but no other node goes to "A". My restriction is that i have to start from "B" so always i can't visit "A"

[Momerath]

Then all nodes have been visited.

[toto_7]

What do you mean all nodes have been visited? what about "A"?

[Momerath]

You don't make a big list of all the nodes in your graph and then 'remove' them as they are visited. You create a dynamic list from your starting node. And as you visit each node you add to this list any nodes that haven't already been visited (and remove the one you are at). When the 'nodes to visit' list is empty, you are done. In your case, node 'A' would never be added to the 'nodes to visit' list, as there is no way to get to it.

[toto_7]

Can i have an example with this situation please?