COIN-OR::LEMON - Graph Library

Changeset 1970:bd88ea06ab69 in lemon-0.x for lemon/euler.h


Ignore:
Timestamp:
02/20/06 07:38:18 (14 years ago)
Author:
Alpar Juttner
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2554
Message:

Doc changes

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/euler.h

    r1956 r1970  
    3535  /// \ingroup topology
    3636  ///This iterator converts to the \c Edge type of the graph and using
    37   ///operator ++ it provides an Euler tour of the graph (if there exists).
     37  ///operator ++ it provides an Euler tour of a \e directed
     38  ///graph (if there exists).
    3839  ///
    3940  ///For example
    4041  ///if the given graph if Euler (i.e it has only one nontrivial component
    4142  ///and the in-degree is equal to the out-degree for all nodes),
    42   ///the following code will print the edge IDs according to an
     43  ///the following code will put the edges of \c g
     44  ///to the vector \c et according to an
    4345  ///Euler tour of \c g.
    4446  ///\code
    45   ///  for(EulerIt<ListGraph> e(g),e!=INVALID;++e) {
    46   ///    std::cout << g.id(e) << std::eol;
    47   ///  }
     47  ///  std::vector<ListGraph::Edge> et;
     48  ///  for(EulerIt<ListGraph> e(g),e!=INVALID;++e)
     49  ///    et.push_back(e);
    4850  ///\endcode
    4951  ///If \c g is not Euler then the resulted tour will not be full or closed.
     52  ///\sa UEulerIt
    5053  ///\todo Test required
    5154  template<class Graph>
     
    119122
    120123  /// \ingroup topology
    121   ///This iterator converts to the \c Edge type of the graph and using
    122   ///operator ++ it provides an Euler tour of the graph (if there exists).
     124  ///This iterator converts to the \c Edge (or \cUEdge)
     125  ///type of the graph and using
     126  ///operator ++ it provides an Euler tour of an \undirected
     127  ///graph (if there exists).
    123128  ///
    124129  ///For example
     
    137142  ///
    138143  ///If \c g is not Euler then the resulted tour will not be full or closed.
     144  ///\sa EulerIt
    139145  ///\todo Test required
    140146  template<class Graph>
Note: See TracChangeset for help on using the changeset viewer.