1.1 --- a/test/euler_test.cc	Mon Feb 23 14:51:10 2009 +0100
     1.2 +++ b/test/euler_test.cc	Mon Feb 23 15:03:55 2009 +0000
     1.3 @@ -25,11 +25,11 @@
     1.4  template <typename Digraph>
     1.5  void checkDiEulerIt(const Digraph& g)
     1.6  {
     1.7 -  typename Digraph::template ArcMap<int> visitationNumber(g);
     1.8 +  typename Digraph::template ArcMap<int> visitationNumber(g, 0);
     1.9  
    1.10    DiEulerIt<Digraph> e(g);
    1.11    typename Digraph::Node firstNode = g.source(e);
    1.12 -  typename Digraph::Node lastNode;
    1.13 +  typename Digraph::Node lastNode = g.target(e);
    1.14  
    1.15    for (; e != INVALID; ++e)
    1.16    {
    1.17 @@ -53,11 +53,11 @@
    1.18  template <typename Graph>
    1.19  void checkEulerIt(const Graph& g)
    1.20  {
    1.21 -  typename Graph::template EdgeMap<int> visitationNumber(g);
    1.22 +  typename Graph::template EdgeMap<int> visitationNumber(g, 0);
    1.23  
    1.24    EulerIt<Graph> e(g);
    1.25    typename Graph::Node firstNode = g.u(e);
    1.26 -  typename Graph::Node lastNode;
    1.27 +  typename Graph::Node lastNode = g.v(e);
    1.28  
    1.29    for (; e != INVALID; ++e)
    1.30    {