# HG changeset patch
# User Peter Kovacs <kpeter@inf.elte.hu>
# Date 1254146000 -7200
# Node ID 6f10c6ec5a21c7d42d3dab98ef84bc936c1142ea
# Parent 0977046c60d27196e3b008fe9f65350180ec5362
Small fixes related to BellmanFord (#51)
- Add a missing #include.
- Add a missing const keyword for negativeCycle().
- Test if negativeCycle() is const function.
diff --git a/lemon/bellman_ford.h b/lemon/bellman_ford.h
|
a
|
b
|
|
| 23 | 23 | /// \file |
| 24 | 24 | /// \brief Bellman-Ford algorithm. |
| 25 | 25 | |
| | 26 | #include <lemon/list_graph.h> |
| 26 | 27 | #include <lemon/bits/path_dump.h> |
| 27 | 28 | #include <lemon/core.h> |
| 28 | 29 | #include <lemon/error.h> |
| … |
… |
|
| 775 | 776 | /// This function gives back a directed cycle with negative total |
| 776 | 777 | /// length if the algorithm has already found one. |
| 777 | 778 | /// Otherwise it gives back an empty path. |
| 778 | | lemon::Path<Digraph> negativeCycle() |
| | 779 | lemon::Path<Digraph> negativeCycle() const { |
| 779 | 780 | typename Digraph::template NodeMap<int> state(*_gr, -1); |
| 780 | 781 | lemon::Path<Digraph> cycle; |
| 781 | 782 | for (int i = 0; i < int(_process.size()); ++i) { |
diff --git a/test/bellman_ford_test.cc b/test/bellman_ford_test.cc
|
a
|
b
|
|
| 96 | 96 | d = const_bf_test.distMap(); |
| 97 | 97 | p = const_bf_test.predMap(); |
| 98 | 98 | pp = const_bf_test.path(t); |
| | 99 | pp = const_bf_test.negativeCycle(); |
| 99 | 100 | |
| 100 | 101 | for (BF::ActiveIt it(const_bf_test); it != INVALID; ++it) {} |
| 101 | 102 | } |
| … |
… |
|
| 132 | 133 | s = bf_test.predNode(t); |
| 133 | 134 | b = bf_test.reached(t); |
| 134 | 135 | pp = bf_test.path(t); |
| | 136 | pp = bf_test.negativeCycle(); |
| 135 | 137 | } |
| 136 | 138 | } |
| 137 | 139 | |
