|
Boost Users : |
From: Abhijit Deshmukh (abhijit.deshmukh_at_[hidden])
Date: 2005-07-27 15:12:11
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
Boost-users list run by williamkempf at hotmail.com, kalb at libertysoft.com, bjorn.karlsson at readsoft.com, gregod at cs.rpi.edu, wekempf at cox.net