COIN-OR::LEMON - Graph Library

Ignore:
File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/bellman_ford.h

    r835 r833  
    2424/// \brief Bellman-Ford algorithm.
    2525
    26 #include <lemon/list_graph.h>
    2726#include <lemon/bits/path_dump.h>
    2827#include <lemon/core.h>
     
    777776    /// length if the algorithm has already found one.
    778777    /// Otherwise it gives back an empty path.
    779     lemon::Path<Digraph> negativeCycle() const {
     778    lemon::Path<Digraph> negativeCycle() {
    780779      typename Digraph::template NodeMap<int> state(*_gr, -1);
    781780      lemon::Path<Digraph> cycle;
Note: See TracChangeset for help on using the changeset viewer.