COIN-OR::LEMON - Graph Library

Ticket #283: euler-aix-9a9629600c20.patch

File euler-aix-9a9629600c20.patch, 1.3 KB (added by Peter Kovacs, 11 years ago)
  • lemon/euler.h

    # 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  
    3636
    3737  ///Euler tour iterator for digraphs.
    3838
    39   /// \ingroup graph_prop
     39  /// \ingroup graph_properties
    4040  ///This iterator provides an Euler tour (Eulerian circuit) of a \e directed
    4141  ///graph (if there exists) and it converts to the \c Arc type of the digraph.
    4242  ///
     
    153153  ///
    154154  ///If \c g has no Euler tour, then the resulted walk will not be closed
    155155  ///or not contain all edges.
     156  ///\sa DiEulerIt
    156157  template<typename GR>
    157158  class EulerIt
    158159  {
  • test/euler_test.cc

    diff --git a/test/euler_test.cc b/test/euler_test.cc
    a b  
    3838  }
    3939
    4040  for (; e != INVALID; ++e) {
    41     if (e != INVALID) lastNode = g.target(e);
     41    lastNode = g.target(e);
    4242    ++visitationNumber[e];
    4343  }
    4444
     
    6767  }
    6868
    6969  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)];
    7272  }
    7373
    7474  check(firstNode == lastNode,