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. Thanks for your answer in anticipation. Regards, Abhijit On 6/28/05, Vladimir Prus wrote:

Abhijit Deshmukh wrote:

...

I am developing an application for which I need to define edges that have only one of the node defined. The second node is not defined. Does BOOST allow to do this? I know this is not the definition of a graph and is considered illegal in defining a graph. I want to know whether this functionality is available in BOOST graph library.

Edge, by definition, connects two vertices. So even if you manage to create an edge with a single vertice, then how would you expect *any* graph algorithm to work with such an thing? Say, if you run depth_first_search visit and it find edge without target vertex -- how can the algorithm proceed?

I suggest you explain in detail what are you trying to achieve.

- Volodya

_______________________________________________ Boost-users mailing list Boost-users@lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

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 wrote:

On Tue, 28 Jun 2005 12:17:15 -0400 Abhijit Deshmukh 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