COIN-OR::LEMON - Graph Library

Changeset 568:3af83b6be1df in lemon


Ignore:
Timestamp:
02/23/09 12:30:15 (10 years ago)
Author:
Alpar Juttner <alpar@…>
Branch:
default
Phase:
public
Message:

Rename euler() to eulerian() (#65)

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/euler.h

    r567 r568  
    229229
    230230
    231   ///Checks if the graph is Euler
     231  ///Checks if the graph is Eulerian
    232232
    233233  /// \ingroup graph_prop
    234   ///Checks if the graph is Euler. It works for both directed and undirected
     234  ///Checks if the graph is Eulerian. It works for both directed and undirected
    235235  ///graphs.
    236   ///\note By definition, a digraph is called \e Euler if
     236  ///\note By definition, a digraph is called \e Eulerian if
    237237  ///and only if it is connected and the number of its incoming and outgoing
    238238  ///arcs are the same for each node.
    239   ///Similarly, an undirected graph is called \e Euler if
     239  ///Similarly, an undirected graph is called \e Eulerian if
    240240  ///and only if it is connected and the number of incident arcs is even
    241   ///for each node. <em>Therefore, there are digraphs which are not Euler, but
    242   ///still have an Euler tour</em>.
     241  ///for each node. <em>Therefore, there are digraphs which are not Eulerian,
     242  ///but still have an Euler tour</em>.
    243243  ///\todo Test required
    244244  template<class Digraph>
     
    247247#else
    248248  typename enable_if<UndirectedTagIndicator<Digraph>,bool>::type
    249   euler(const Digraph &g)
     249  eulerian(const Digraph &g)
    250250  {
    251251    for(typename Digraph::NodeIt n(g);n!=INVALID;++n)
     
    256256  typename disable_if<UndirectedTagIndicator<Digraph>,bool>::type
    257257#endif
    258   euler(const Digraph &g)
     258  eulerian(const Digraph &g)
    259259  {
    260260    for(typename Digraph::NodeIt n(g);n!=INVALID;++n)
Note: See TracChangeset for help on using the changeset viewer.