|
|
Boost Users : |
Subject: Re: [Boost-users] [BGL] IncidenceGraph and out_edges
From: Andrew Sutton (andrew.n.sutton_at_[hidden])
Date: 2009-06-19 07:35:20
> A explicit function for traversing all vertices connected via an edge to a
> fixed vertex.
That's exactly what the adjacency_iterator is for.
http://www.boost.org/doc/libs/1_39_0/libs/graph/doc/AdjacencyGraph.html
http://www.boost.org/doc/libs/1_39_0/libs/graph/doc/adjacency_iterator.html
Andrew Sutton
andrew.n.sutton_at_[hidden]
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