|
Boost : |
From: sashan (sashang_at_[hidden])
Date: 2003-09-08 15:36:10
Hi
Is there an adjancency iterator for property types. You can get an
iterator for property types like this:
typedef graph_property_iter_range<GraphType, vertex_name_t>::iterator
VNameIterator;
....
tie(It, ItEnd) = get_property_iter_range(m_Graph, vertex_name);
I'd like to know if there is something similar for adjacency iterators.
I posted this question a few days ago to the users list but got no
response so I guess that the answer is no but I want to make sure.
Thanks
-- sashan http://www.cs.auckland.ac.nz/~sgov008/
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk