Hi, Using a dummy vertex seems to be right option, since the definition is illegal for graphs. Thanks a lot for your suggestions. Regards, Abhijit Deshmukh On 6/28/05, Slawomir Nowaczyk <slawomir.nowaczyk.847@student.lu.se> wrote:
On Tue, 28 Jun 2005 12:17:15 -0400 Abhijit Deshmukh <abhijit.deshmukh@gmail.com> wrote:
#> Hi, #> #> 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 mailing list Boost-users@lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users