Boost logo

Boost Users :

Subject: Re: [Boost-users] Bidirectional Graph and undirected graphs
From: Andrew Sutton (andrew.n.sutton_at_[hidden])
Date: 2009-05-13 16:38:37

> The latter implies that undirected graphs have to have two copies of each
> edge, one pointed each direction.
> Which is correct? The former, I hope :-) Thanks.

Undirected graphs store only one set of edges. The implementation of the
just makes it seem like two different copies :)

Andrew Sutton

Boost-users list run by williamkempf at, kalb at, bjorn.karlsson at, gregod at, wekempf at