[Boost-users] Branch and Bound alogorithm

Hi everyone, I'm a new user of BGL. So can anyone please tell me whether any direct Branch and Bound algorithm is already implemented in BGL? I haven't been able to find any. Basically I have to modify DFS using branch and bound scheme to avoid unnecessary computations. I think that the DFS Visitor interface can be used to do that. Is this the best way to proceed? Thanks in advance, with regards, Abhijit