lemon/concept/graph.h
changeset 1557 3e8d928e283d
parent 1448 0274acee0e35
child 1563 0853ed07a677
equal deleted inserted replaced
1:4db31324b423 2:17497a648889
   209         /// Sets the iterator to the first node of \c g.
   209         /// Sets the iterator to the first node of \c g.
   210         ///
   210         ///
   211         NodeIt(const StaticGraph&) { }
   211         NodeIt(const StaticGraph&) { }
   212         /// Node -> NodeIt conversion.
   212         /// Node -> NodeIt conversion.
   213 
   213 
   214         /// Sets the iterator to the node of \c g pointed by the trivial 
   214         /// Sets the iterator to the node of \c the graph pointed by 
   215         /// iterator n.
   215 	/// the trivial iterator.
   216         /// This feature necessitates that each time we 
   216         /// This feature necessitates that each time we 
   217         /// iterate the edge-set, the iteration order is the same.
   217         /// iterate the edge-set, the iteration order is the same.
   218         NodeIt(const StaticGraph& g, const Node& n) { }
   218         NodeIt(const StaticGraph&, const Node&) { }
   219         /// Next node.
   219         /// Next node.
   220 
   220 
   221         /// Assign the iterator to the next node.
   221         /// Assign the iterator to the next node.
   222         ///
   222         ///
   223         NodeIt& operator++() { return *this; }
   223         NodeIt& operator++() { return *this; }
   293         ///@param n the node
   293         ///@param n the node
   294         ///@param g the graph
   294         ///@param g the graph
   295         OutEdgeIt(const StaticGraph&, const Node&) { }
   295         OutEdgeIt(const StaticGraph&, const Node&) { }
   296         /// Edge -> OutEdgeIt conversion
   296         /// Edge -> OutEdgeIt conversion
   297 
   297 
   298         /// Sets the iterator to the value of the trivial iterator \c e.
   298         /// Sets the iterator to the value of the trivial iterator.
   299         /// This feature necessitates that each time we 
   299 	/// This feature necessitates that each time we 
   300         /// iterate the edge-set, the iteration order is the same.
   300         /// iterate the edge-set, the iteration order is the same.
   301         OutEdgeIt(const StaticGraph& g, const Edge& e) { }
   301         OutEdgeIt(const StaticGraph&, const Edge&) { }
   302         ///Next outgoing edge
   302         ///Next outgoing edge
   303         
   303         
   304         /// Assign the iterator to the next 
   304         /// Assign the iterator to the next 
   305         /// outgoing edge of the corresponding node.
   305         /// outgoing edge of the corresponding node.
   306         OutEdgeIt& operator++() { return *this; }
   306         OutEdgeIt& operator++() { return *this; }