Changeset 781:6f10c6ec5a21 in lemon-main
- Timestamp:
- 09/28/09 15:53:20 (15 years ago)
- Branch:
- default
- Phase:
- public
- Files:
-
- 2 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/bellman_ford.h
r699 r781 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> … … 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; -
test/bellman_ford_test.cc
r699 r781 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) {} … … 133 134 b = bf_test.reached(t); 134 135 pp = bf_test.path(t); 136 pp = bf_test.negativeCycle(); 135 137 } 136 138 }
Note: See TracChangeset
for help on using the changeset viewer.