lemon/concepts/digraph.h
changeset 847 754272f20318
parent 734 bd72f8d20f33
child 877 141f9c0db4a3
equal deleted inserted replaced
10:528c5e757510 11:71e96538a75f
   105       };
   105       };
   106 
   106 
   107       /// Iterator class for the nodes.
   107       /// Iterator class for the nodes.
   108 
   108 
   109       /// This iterator goes through each node of the digraph.
   109       /// This iterator goes through each node of the digraph.
   110       /// Its usage is quite simple, for example you can count the number
   110       /// Its usage is quite simple, for example, you can count the number
   111       /// of nodes in a digraph \c g of type \c %Digraph like this:
   111       /// of nodes in a digraph \c g of type \c %Digraph like this:
   112       ///\code
   112       ///\code
   113       /// int count=0;
   113       /// int count=0;
   114       /// for (Digraph::NodeIt n(g); n!=INVALID; ++n) ++count;
   114       /// for (Digraph::NodeIt n(g); n!=INVALID; ++n) ++count;
   115       ///\endcode
   115       ///\endcode
   194 
   194 
   195       /// Iterator class for the outgoing arcs of a node.
   195       /// Iterator class for the outgoing arcs of a node.
   196 
   196 
   197       /// This iterator goes trough the \e outgoing arcs of a certain node
   197       /// This iterator goes trough the \e outgoing arcs of a certain node
   198       /// of a digraph.
   198       /// of a digraph.
   199       /// Its usage is quite simple, for example you can count the number
   199       /// Its usage is quite simple, for example, you can count the number
   200       /// of outgoing arcs of a node \c n
   200       /// of outgoing arcs of a node \c n
   201       /// in a digraph \c g of type \c %Digraph as follows.
   201       /// in a digraph \c g of type \c %Digraph as follows.
   202       ///\code
   202       ///\code
   203       /// int count=0;
   203       /// int count=0;
   204       /// for (Digraph::OutArcIt a(g, n); a!=INVALID; ++a) ++count;
   204       /// for (Digraph::OutArcIt a(g, n); a!=INVALID; ++a) ++count;
   239 
   239 
   240       /// Iterator class for the incoming arcs of a node.
   240       /// Iterator class for the incoming arcs of a node.
   241 
   241 
   242       /// This iterator goes trough the \e incoming arcs of a certain node
   242       /// This iterator goes trough the \e incoming arcs of a certain node
   243       /// of a digraph.
   243       /// of a digraph.
   244       /// Its usage is quite simple, for example you can count the number
   244       /// Its usage is quite simple, for example, you can count the number
   245       /// of incoming arcs of a node \c n
   245       /// of incoming arcs of a node \c n
   246       /// in a digraph \c g of type \c %Digraph as follows.
   246       /// in a digraph \c g of type \c %Digraph as follows.
   247       ///\code
   247       ///\code
   248       /// int count=0;
   248       /// int count=0;
   249       /// for(Digraph::InArcIt a(g, n); a!=INVALID; ++a) ++count;
   249       /// for(Digraph::InArcIt a(g, n); a!=INVALID; ++a) ++count;
   283       };
   283       };
   284 
   284 
   285       /// Iterator class for the arcs.
   285       /// Iterator class for the arcs.
   286 
   286 
   287       /// This iterator goes through each arc of the digraph.
   287       /// This iterator goes through each arc of the digraph.
   288       /// Its usage is quite simple, for example you can count the number
   288       /// Its usage is quite simple, for example, you can count the number
   289       /// of arcs in a digraph \c g of type \c %Digraph as follows:
   289       /// of arcs in a digraph \c g of type \c %Digraph as follows:
   290       ///\code
   290       ///\code
   291       /// int count=0;
   291       /// int count=0;
   292       /// for(Digraph::ArcIt a(g); a!=INVALID; ++a) ++count;
   292       /// for(Digraph::ArcIt a(g); a!=INVALID; ++a) ++count;
   293       ///\endcode
   293       ///\endcode