Mercuriallemon-0.x / comparison
summary | shortlog | changelog | graph | tags | bookmarks | branches | files | changeset | file | latest | revisions | annotate | diff | comparison | raw | help
lemon/concept/ugraph.h
changeset 1952 6150d1cf0825
parent 1910 f95eea8c34b0
child 1956 a055123339d5
equal deleted inserted replaced
1:40a31c264a95 2:e663ae2472e0 
   302       /// This iterator goes through each node.
 
   302       /// This iterator goes through each node.
 
   303 
   303 
   304       /// This iterator goes through each node.
 
   304       /// This iterator goes through each node.
 
   305       /// Its usage is quite simple, for example you can count the number
 
   305       /// Its usage is quite simple, for example you can count the number
 
   306       /// of nodes in graph \c g of type \c Graph like this:
 
   306       /// of nodes in graph \c g of type \c Graph like this:
 
   307       /// \code
 
   307       ///\code
 
   308       /// int count=0;
 
   308       /// int count=0;
 
   309       /// for (Graph::NodeIt n(g); n!=INVALID; ++n) ++count;
 
   309       /// for (Graph::NodeIt n(g); n!=INVALID; ++n) ++count;
 
   310       /// \endcode
 
   310       ///\endcode
 
   311       class NodeIt : public Node {
 
   311       class NodeIt : public Node {
 
   312       public:
 
   312       public:
 
   313         /// Default constructor
 
   313         /// Default constructor
 
   314 
   314 
   315         /// @warning The default constructor sets the iterator
 
   315         /// @warning The default constructor sets the iterator
 
   393       /// This iterator goes through each undirected edge.
 
   393       /// This iterator goes through each undirected edge.
 
   394 
   394 
   395       /// This iterator goes through each undirected edge of a graph.
 
   395       /// This iterator goes through each undirected edge of a graph.
 
   396       /// Its usage is quite simple, for example you can count the number
 
   396       /// Its usage is quite simple, for example you can count the number
 
   397       /// of undirected edges in a graph \c g of type \c Graph as follows:
 
   397       /// of undirected edges in a graph \c g of type \c Graph as follows:
 
   398       /// \code
 
   398       ///\code
 
   399       /// int count=0;
 
   399       /// int count=0;
 
   400       /// for(Graph::UEdgeIt e(g); e!=INVALID; ++e) ++count;
 
   400       /// for(Graph::UEdgeIt e(g); e!=INVALID; ++e) ++count;
 
   401       /// \endcode
 
   401       ///\endcode
 
   402       class UEdgeIt : public UEdge {
 
   402       class UEdgeIt : public UEdge {
 
   403       public:
 
   403       public:
 
   404         /// Default constructor
 
   404         /// Default constructor
 
   405 
   405 
   406         /// @warning The default constructor sets the iterator
 
   406         /// @warning The default constructor sets the iterator
 
   441       /// of a graph.
 
   441       /// of a graph.
 
   442       /// Its usage is quite simple, for example you can compute the
 
   442       /// Its usage is quite simple, for example you can compute the
 
   443       /// degree (i.e. count the number
 
   443       /// degree (i.e. count the number
 
   444       /// of incident edges of a node \c n
 
   444       /// of incident edges of a node \c n
 
   445       /// in graph \c g of type \c Graph as follows.
 
   445       /// in graph \c g of type \c Graph as follows.
 
   446       /// \code
 
   446       ///\code
 
   447       /// int count=0;
 
   447       /// int count=0;
 
   448       /// for(Graph::IncEdgeIt e(g, n); e!=INVALID; ++e) ++count;
 
   448       /// for(Graph::IncEdgeIt e(g, n); e!=INVALID; ++e) ++count;
 
   449       /// \endcode
 
   449       ///\endcode
 
   450       class IncEdgeIt : public UEdge {
 
   450       class IncEdgeIt : public UEdge {
 
   451       public:
 
   451       public:
 
   452         /// Default constructor
 
   452         /// Default constructor
 
   453 
   453 
   454         /// @warning The default constructor sets the iterator
 
   454         /// @warning The default constructor sets the iterator
 
   530       /// This iterator goes through each directed edge.
 
   530       /// This iterator goes through each directed edge.
 
   531 
   531 
   532       /// This iterator goes through each edge of a graph.
 
   532       /// This iterator goes through each edge of a graph.
 
   533       /// Its usage is quite simple, for example you can count the number
 
   533       /// Its usage is quite simple, for example you can count the number
 
   534       /// of edges in a graph \c g of type \c Graph as follows:
 
   534       /// of edges in a graph \c g of type \c Graph as follows:
 
   535       /// \code
 
   535       ///\code
 
   536       /// int count=0;
 
   536       /// int count=0;
 
   537       /// for(Graph::EdgeIt e(g); e!=INVALID; ++e) ++count;
 
   537       /// for(Graph::EdgeIt e(g); e!=INVALID; ++e) ++count;
 
   538       /// \endcode
 
   538       ///\endcode
 
   539       class EdgeIt : public Edge {
 
   539       class EdgeIt : public Edge {
 
   540       public:
 
   540       public:
 
   541         /// Default constructor
 
   541         /// Default constructor
 
   542 
   542 
   543         /// @warning The default constructor sets the iterator
 
   543         /// @warning The default constructor sets the iterator
 
   575       /// This iterator goes trough the \e outgoing edges of a certain node
 
   575       /// This iterator goes trough the \e outgoing edges of a certain node
 
   576       /// of a graph.
 
   576       /// of a graph.
 
   577       /// Its usage is quite simple, for example you can count the number
 
   577       /// Its usage is quite simple, for example you can count the number
 
   578       /// of outgoing edges of a node \c n
 
   578       /// of outgoing edges of a node \c n
 
   579       /// in graph \c g of type \c Graph as follows.
 
   579       /// in graph \c g of type \c Graph as follows.
 
   580       /// \code
 
   580       ///\code
 
   581       /// int count=0;
 
   581       /// int count=0;
 
   582       /// for (Graph::OutEdgeIt e(g, n); e!=INVALID; ++e) ++count;
 
   582       /// for (Graph::OutEdgeIt e(g, n); e!=INVALID; ++e) ++count;
 
   583       /// \endcode
 
   583       ///\endcode
 
   584     
   584     
   585       class OutEdgeIt : public Edge {
 
   585       class OutEdgeIt : public Edge {
 
   586       public:
 
   586       public:
 
   587         /// Default constructor
 
   587         /// Default constructor
 
   588 
   588 
   627       /// This iterator goes trough the \e incoming edges of a certain node
 
   627       /// This iterator goes trough the \e incoming edges of a certain node
 
   628       /// of a graph.
 
   628       /// of a graph.
 
   629       /// Its usage is quite simple, for example you can count the number
 
   629       /// Its usage is quite simple, for example you can count the number
 
   630       /// of outgoing edges of a node \c n
 
   630       /// of outgoing edges of a node \c n
 
   631       /// in graph \c g of type \c Graph as follows.
 
   631       /// in graph \c g of type \c Graph as follows.
 
   632       /// \code
 
   632       ///\code
 
   633       /// int count=0;
 
   633       /// int count=0;
 
   634       /// for(Graph::InEdgeIt e(g, n); e!=INVALID; ++e) ++count;
 
   634       /// for(Graph::InEdgeIt e(g, n); e!=INVALID; ++e) ++count;
 
   635       /// \endcode
 
   635       ///\endcode
 
   636 
   636 
   637       class InEdgeIt : public Edge {
 
   637       class InEdgeIt : public Edge {
 
   638       public:
 
   638       public:
 
   639         /// Default constructor
 
   639         /// Default constructor
 
   640 
   640
lemon-0.x