src/lemon/iterable_graph_extender.h
changeset 1027 4ec35d1cd897
parent 1021 fd1d073b6557
child 1030 c8a41699e613
equal deleted inserted replaced
2:fabaa2dcea51 3:131f2a8ff7ec
   174       {
   174       {
   175 	_graph._dirFirstOut(*this, n);
   175 	_graph._dirFirstOut(*this, n);
   176       }
   176       }
   177 
   177 
   178       // FIXME: Do we need this type of constructor here?
   178       // FIXME: Do we need this type of constructor here?
   179       // UndirIncEdgeIt(const Graph& _graph, const UndirEdge& e) : 
   179       // UndirIncEdgeIt(const Graph& _graph, const Edge& e) : 
   180       //   UndirEdge(e), graph(&_graph) { }
   180       //   UndirEdge(e), graph(&_graph), forward(_graph.forward(e)) { }
       
   181       // or
       
   182       // UndirIncEdgeIt(const Graph& _graph, const Node& n,
       
   183       //    Const UndirEdge &e) ... ?
   181 
   184 
   182       UndirIncEdgeIt& operator++() {
   185       UndirIncEdgeIt& operator++() {
   183 	graph->_dirNextOut(*this);
   186 	graph->_dirNextOut(*this);
   184 	return *this; 
   187 	return *this; 
   185       }
   188       }