Boost Users :
From: Slawomir Nowaczyk (slawomir.nowaczyk.847_at_[hidden])
Date: 2005-06-28 13:48:09
On Tue, 28 Jun 2005 12:17:15 -0400
Abhijit Deshmukh <abhijit.deshmukh_at_[hidden]> wrote:
#> I have a algorithm that will perform the search function for me. At
#> this point I would not be using any standard algorithm available in
#> BOOST graph library. I would still like to use BOOST for the data
#> structures and for future migration if required.
#> I just want to know whether this can be done in BOOST.
Is there any reason why introducing a special, artificial vertex as
the "fake" end for all the dangling wouldn't work for you?
-- Best wishes, Slawomir Nowaczyk Get the facts first - you can distort them later!
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