Hi all

I have this paragraph, I think it can be summarised as a Breadth-first search description.

Am I right?Starting at the root node 0, your branch-and-bound algorithm explores paths to every reachable node in the graph while keeping in mind the cost of the partially explored path. As such, the algorithm keeps track of the cost of reaching every node in the tree from the root. It will also prune paths below a particular node in the tree if the cost of the node exceeds the cost of an already completed tour.

Thanks.