Boost logo

Boost Users :

From: Shufei Fan (fansf_at_[hidden])
Date: 2007-03-07 10:10:56


Douglas Gregor <doug.gregor <at> gmail.com> writes:

> The document doesn't define this, but it should. It depends on
> precisely which graph type you're using, but...
>
> If you're using an adjacency list with OutEdgeListS=setS, or if
> you're using an adjacency matrix, the out-edges will be ordered
> increasing order of the target.
> If you're using an adjacency list with any other OutEdgeListS, or if
> you're using a compressed sparse row graph, the out-edges will have
> the same order as the order that they were inserted into the graph.
>
> Cheers,
> Doug
>

At the same time, I actually experimented to find out the answer, which
coincides with your explanations. Thanks to you all!
Shufei


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