# HG changeset patch
# User Peter Kovacs <kpeter@inf.elte.hu>
# Date 1241541299 -7200
# Node ID 9a9629600c20252736ba71b7bba46af9f73d9011
# Parent e01957e96c6796a11d9f3bbf751eea8ae274221c
Bug fixes related to Euler iterators (#283)
diff --git a/lemon/euler.h b/lemon/euler.h
|
a
|
b
|
|
| 36 | 36 | |
| 37 | 37 | ///Euler tour iterator for digraphs. |
| 38 | 38 | |
| 39 | | /// \ingroup graph_prop |
| | 39 | /// \ingroup graph_properties |
| 40 | 40 | ///This iterator provides an Euler tour (Eulerian circuit) of a \e directed |
| 41 | 41 | ///graph (if there exists) and it converts to the \c Arc type of the digraph. |
| 42 | 42 | /// |
| … |
… |
|
| 153 | 153 | /// |
| 154 | 154 | ///If \c g has no Euler tour, then the resulted walk will not be closed |
| 155 | 155 | ///or not contain all edges. |
| | 156 | ///\sa DiEulerIt |
| 156 | 157 | template<typename GR> |
| 157 | 158 | class EulerIt |
| 158 | 159 | { |
diff --git a/test/euler_test.cc b/test/euler_test.cc
|
a
|
b
|
|
| 38 | 38 | } |
| 39 | 39 | |
| 40 | 40 | for (; e != INVALID; ++e) { |
| 41 | | if (e != INVALID) lastNode = g.target(e); |
| | 41 | lastNode = g.target(e); |
| 42 | 42 | ++visitationNumber[e]; |
| 43 | 43 | } |
| 44 | 44 | |
| … |
… |
|
| 67 | 67 | } |
| 68 | 68 | |
| 69 | 69 | for (; e != INVALID; ++e) { |
| 70 | | if (e != INVALID) lastNode = g.target(typename Graph::Arc(e)); |
| 71 | | ++visitationNumber[e]; |
| | 70 | lastNode = g.target(typename Graph::Arc(e)); |
| | 71 | ++visitationNumber[typename Graph::Edge(e)]; |
| 72 | 72 | } |
| 73 | 73 | |
| 74 | 74 | check(firstNode == lastNode, |
