Changeset 1769:a67ec111236c in lemon-0.x
- Timestamp:
- 11/04/05 17:10:23 (19 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2301
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/euler.h
r1761 r1769 17 17 #include <list> 18 18 19 /// \ingroup gutils19 /// \ingroup topology 20 20 /// \file 21 21 /// \brief Euler tour … … 29 29 ///Euler iterator in directed graphs. 30 30 31 /// \ingroup gutils31 /// \ingroup topology 32 32 ///This iterator converts to the \c Edge type of the graph and using 33 33 ///the ++ operator it provides an Euler tour of the graph (if there exists). … … 115 115 ///Checks if the graph is Euler. It works for both directed and 116 116 ///undirected graphs. 117 ///\todo What to do with the isolated points?118 117 ///\todo Test required 119 118 template<class Graph>
Note: See TracChangeset
for help on using the changeset viewer.