20 May
2010
20 May
'10
6:03 p.m.
On Thu, 20 May 2010, Hossein Haeri wrote:
Dear all,
Is there any way to deduce the graph a graph-iterator is iterating over? So, for example for:
typedef graph_type::vertex_iterator iterator; iterator begin, end; tie(begin, end) = vertices(g);
is there anything like
graph_type gg = graph_of(begin);
so that gg == g?
That's not really possible, just like there is no mapping from STL iterators to their corresponding paper. In some cases (I think actually most of them), the vertex iterators of a graph don't have a reference to the graph at all. -- Jeremiah Willcock