Boost logo

Boost Users :

From: Doug Gregor (dgregor_at_[hidden])
Date: 2005-07-28 17:40:33

On Jul 27, 2005, at 3:12 PM, Abhijit Deshmukh wrote:

> 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?

We don't have any implementation of Branch and Bound in the BGL at the
moment. You could probably formulate it as a DFS visitor.


Boost-users list run by williamkempf at, kalb at, bjorn.karlsson at, gregod at, wekempf at