Re: [Boost-users] Dangling edges in BOOST graph library

From: Vladimir Prus (ghost_at_[hidden])
Date: 2005-06-28 00:54:54

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