COIN-OR::LEMON - Graph Library

Changeset 1769:a67ec111236c in lemon-0.x


Ignore:
Timestamp:
11/04/05 17:10:23 (14 years ago)
Author:
Balazs Dezso
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2301
Message:

Removed todo
Moved to topology module

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/euler.h

    r1761 r1769  
    1717#include <list>
    1818
    19 /// \ingroup gutils
     19/// \ingroup topology
    2020/// \file
    2121/// \brief Euler tour
     
    2929  ///Euler iterator in directed graphs.
    3030
    31   /// \ingroup gutils
     31  /// \ingroup topology
    3232  ///This iterator converts to the \c Edge type of the graph and using
    3333  ///the ++ operator it provides an Euler tour of the graph (if there exists).
     
    115115  ///Checks if the graph is Euler. It works for both directed and
    116116  ///undirected graphs.
    117   ///\todo What to do with the isolated points?
    118117  ///\todo Test required
    119118  template<class Graph>
Note: See TracChangeset for help on using the changeset viewer.