... | ... |
@@ -25,11 +25,11 @@ |
25 | 25 |
template <typename Digraph> |
26 | 26 |
void checkDiEulerIt(const Digraph& g) |
27 | 27 |
{ |
28 |
typename Digraph::template ArcMap<int> visitationNumber(g); |
|
28 |
typename Digraph::template ArcMap<int> visitationNumber(g, 0); |
|
29 | 29 |
|
30 | 30 |
DiEulerIt<Digraph> e(g); |
31 | 31 |
typename Digraph::Node firstNode = g.source(e); |
32 |
typename Digraph::Node lastNode; |
|
32 |
typename Digraph::Node lastNode = g.target(e); |
|
33 | 33 |
|
34 | 34 |
for (; e != INVALID; ++e) |
35 | 35 |
{ |
... | ... |
@@ -53,11 +53,11 @@ |
53 | 53 |
template <typename Graph> |
54 | 54 |
void checkEulerIt(const Graph& g) |
55 | 55 |
{ |
56 |
typename Graph::template EdgeMap<int> visitationNumber(g); |
|
56 |
typename Graph::template EdgeMap<int> visitationNumber(g, 0); |
|
57 | 57 |
|
58 | 58 |
EulerIt<Graph> e(g); |
59 | 59 |
typename Graph::Node firstNode = g.u(e); |
60 |
typename Graph::Node lastNode; |
|
60 |
typename Graph::Node lastNode = g.v(e); |
|
61 | 61 |
|
62 | 62 |
for (; e != INVALID; ++e) |
63 | 63 |
{ |
0 comments (0 inline)