Mercuriallemon-0.x / comparison
summary | shortlog | changelog | graph | tags | bookmarks | branches | files | changeset | file | latest | revisions | annotate | diff | comparison | raw | help
lemon/concept/bpugraph.h
changeset 1948 9e9c035a08be
parent 1933 a876a3d6a4c7
child 1956 a055123339d5
equal deleted inserted replaced
1:a2bf8b5c61f7 2:f0314a33d657 
   242       /// This iterator goes through each node.
 
   242       /// This iterator goes through each node.
 
   243 
   243 
   244       /// This iterator goes through each node.
 
   244       /// This iterator goes through each node.
 
   245       /// Its usage is quite simple, for example you can count the number
 
   245       /// Its usage is quite simple, for example you can count the number
 
   246       /// of nodes in graph \c g of type \c Graph like this:
 
   246       /// of nodes in graph \c g of type \c Graph like this:
 
   247       /// \code
 
   247       ///\code
 
   248       /// int count=0;
 
   248       /// int count=0;
 
   249       /// for (Graph::NodeIt n(g); n!=INVALID; ++n) ++count;
 
   249       /// for (Graph::NodeIt n(g); n!=INVALID; ++n) ++count;
 
   250       /// \endcode
 
   250       ///\endcode
 
   251       class NodeIt : public Node {
 
   251       class NodeIt : public Node {
 
   252       public:
 
   252       public:
 
   253         /// Default constructor
 
   253         /// Default constructor
 
   254 
   254 
   255         /// @warning The default constructor sets the iterator
 
   255         /// @warning The default constructor sets the iterator
 
   287       /// This iterator goes through each ANode.
 
   287       /// This iterator goes through each ANode.
 
   288 
   288 
   289       /// This iterator goes through each ANode.
 
   289       /// This iterator goes through each ANode.
 
   290       /// Its usage is quite simple, for example you can count the number
 
   290       /// Its usage is quite simple, for example you can count the number
 
   291       /// of nodes in graph \c g of type \c Graph like this:
 
   291       /// of nodes in graph \c g of type \c Graph like this:
 
   292       /// \code
 
   292       ///\code
 
   293       /// int count=0;
 
   293       /// int count=0;
 
   294       /// for (Graph::ANodeIt n(g); n!=INVALID; ++n) ++count;
 
   294       /// for (Graph::ANodeIt n(g); n!=INVALID; ++n) ++count;
 
   295       /// \endcode
 
   295       ///\endcode
 
   296       class ANodeIt : public ANode {
 
   296       class ANodeIt : public ANode {
 
   297       public:
 
   297       public:
 
   298         /// Default constructor
 
   298         /// Default constructor
 
   299 
   299 
   300         /// @warning The default constructor sets the iterator
 
   300         /// @warning The default constructor sets the iterator
 
   332       /// This iterator goes through each BNode.
 
   332       /// This iterator goes through each BNode.
 
   333 
   333 
   334       /// This iterator goes through each BNode.
 
   334       /// This iterator goes through each BNode.
 
   335       /// Its usage is quite simple, for example you can count the number
 
   335       /// Its usage is quite simple, for example you can count the number
 
   336       /// of nodes in graph \c g of type \c Graph like this:
 
   336       /// of nodes in graph \c g of type \c Graph like this:
 
   337       /// \code
 
   337       ///\code
 
   338       /// int count=0;
 
   338       /// int count=0;
 
   339       /// for (Graph::BNodeIt n(g); n!=INVALID; ++n) ++count;
 
   339       /// for (Graph::BNodeIt n(g); n!=INVALID; ++n) ++count;
 
   340       /// \endcode
 
   340       ///\endcode
 
   341       class BNodeIt : public BNode {
 
   341       class BNodeIt : public BNode {
 
   342       public:
 
   342       public:
 
   343         /// Default constructor
 
   343         /// Default constructor
 
   344 
   344 
   345         /// @warning The default constructor sets the iterator
 
   345         /// @warning The default constructor sets the iterator
 
   423       /// This iterator goes through each undirected edge.
 
   423       /// This iterator goes through each undirected edge.
 
   424 
   424 
   425       /// This iterator goes through each undirected edge of a graph.
 
   425       /// This iterator goes through each undirected edge of a graph.
 
   426       /// Its usage is quite simple, for example you can count the number
 
   426       /// Its usage is quite simple, for example you can count the number
 
   427       /// of undirected edges in a graph \c g of type \c Graph as follows:
 
   427       /// of undirected edges in a graph \c g of type \c Graph as follows:
 
   428       /// \code
 
   428       ///\code
 
   429       /// int count=0;
 
   429       /// int count=0;
 
   430       /// for(Graph::UEdgeIt e(g); e!=INVALID; ++e) ++count;
 
   430       /// for(Graph::UEdgeIt e(g); e!=INVALID; ++e) ++count;
 
   431       /// \endcode
 
   431       ///\endcode
 
   432       class UEdgeIt : public UEdge {
 
   432       class UEdgeIt : public UEdge {
 
   433       public:
 
   433       public:
 
   434         /// Default constructor
 
   434         /// Default constructor
 
   435 
   435 
   436         /// @warning The default constructor sets the iterator
 
   436         /// @warning The default constructor sets the iterator
 
   471       /// of a graph.
 
   471       /// of a graph.
 
   472       /// Its usage is quite simple, for example you can compute the
 
   472       /// Its usage is quite simple, for example you can compute the
 
   473       /// degree (i.e. count the number
 
   473       /// degree (i.e. count the number
 
   474       /// of incident edges of a node \c n
 
   474       /// of incident edges of a node \c n
 
   475       /// in graph \c g of type \c Graph as follows.
 
   475       /// in graph \c g of type \c Graph as follows.
 
   476       /// \code
 
   476       ///\code
 
   477       /// int count=0;
 
   477       /// int count=0;
 
   478       /// for(Graph::IncEdgeIt e(g, n); e!=INVALID; ++e) ++count;
 
   478       /// for(Graph::IncEdgeIt e(g, n); e!=INVALID; ++e) ++count;
 
   479       /// \endcode
 
   479       ///\endcode
 
   480       class IncEdgeIt : public UEdge {
 
   480       class IncEdgeIt : public UEdge {
 
   481       public:
 
   481       public:
 
   482         /// Default constructor
 
   482         /// Default constructor
 
   483 
   483 
   484         /// @warning The default constructor sets the iterator
 
   484         /// @warning The default constructor sets the iterator
 
   560       /// This iterator goes through each directed edge.
 
   560       /// This iterator goes through each directed edge.
 
   561 
   561 
   562       /// This iterator goes through each edge of a graph.
 
   562       /// This iterator goes through each edge of a graph.
 
   563       /// Its usage is quite simple, for example you can count the number
 
   563       /// Its usage is quite simple, for example you can count the number
 
   564       /// of edges in a graph \c g of type \c Graph as follows:
 
   564       /// of edges in a graph \c g of type \c Graph as follows:
 
   565       /// \code
 
   565       ///\code
 
   566       /// int count=0;
 
   566       /// int count=0;
 
   567       /// for(Graph::EdgeIt e(g); e!=INVALID; ++e) ++count;
 
   567       /// for(Graph::EdgeIt e(g); e!=INVALID; ++e) ++count;
 
   568       /// \endcode
 
   568       ///\endcode
 
   569       class EdgeIt : public Edge {
 
   569       class EdgeIt : public Edge {
 
   570       public:
 
   570       public:
 
   571         /// Default constructor
 
   571         /// Default constructor
 
   572 
   572 
   573         /// @warning The default constructor sets the iterator
 
   573         /// @warning The default constructor sets the iterator
 
   605       /// This iterator goes trough the \e outgoing edges of a certain node
 
   605       /// This iterator goes trough the \e outgoing edges of a certain node
 
   606       /// of a graph.
 
   606       /// of a graph.
 
   607       /// Its usage is quite simple, for example you can count the number
 
   607       /// Its usage is quite simple, for example you can count the number
 
   608       /// of outgoing edges of a node \c n
 
   608       /// of outgoing edges of a node \c n
 
   609       /// in graph \c g of type \c Graph as follows.
 
   609       /// in graph \c g of type \c Graph as follows.
 
   610       /// \code
 
   610       ///\code
 
   611       /// int count=0;
 
   611       /// int count=0;
 
   612       /// for (Graph::OutEdgeIt e(g, n); e!=INVALID; ++e) ++count;
 
   612       /// for (Graph::OutEdgeIt e(g, n); e!=INVALID; ++e) ++count;
 
   613       /// \endcode
 
   613       ///\endcode
 
   614     
   614     
   615       class OutEdgeIt : public Edge {
 
   615       class OutEdgeIt : public Edge {
 
   616       public:
 
   616       public:
 
   617         /// Default constructor
 
   617         /// Default constructor
 
   618 
   618 
   657       /// This iterator goes trough the \e incoming edges of a certain node
 
   657       /// This iterator goes trough the \e incoming edges of a certain node
 
   658       /// of a graph.
 
   658       /// of a graph.
 
   659       /// Its usage is quite simple, for example you can count the number
 
   659       /// Its usage is quite simple, for example you can count the number
 
   660       /// of outgoing edges of a node \c n
 
   660       /// of outgoing edges of a node \c n
 
   661       /// in graph \c g of type \c Graph as follows.
 
   661       /// in graph \c g of type \c Graph as follows.
 
   662       /// \code
 
   662       ///\code
 
   663       /// int count=0;
 
   663       /// int count=0;
 
   664       /// for(Graph::InEdgeIt e(g, n); e!=INVALID; ++e) ++count;
 
   664       /// for(Graph::InEdgeIt e(g, n); e!=INVALID; ++e) ++count;
 
   665       /// \endcode
 
   665       ///\endcode
 
   666 
   666 
   667       class InEdgeIt : public Edge {
 
   667       class InEdgeIt : public Edge {
 
   668       public:
 
   668       public:
 
   669         /// Default constructor
 
   669         /// Default constructor
 
   670 
   670
lemon-0.x