boost/graph
2
0
Fork 0
mirror of https://github.com/boostorg/graph.git synced 2026-01-28 19:22:11 +00:00
Code Issues Projects Releases Wiki Activity

added optimization of stopping as soon as relaxation is done

Browse Source 
(thanks Herve for the suggestion!)


[SVN r13977]
This commit is contained in:
Jeremy Siek
2002-05-19 15:42:14 +00:00
parent ad88071877
commit 63290266da
1 changed files with 9 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

13
include/boost/graph/bellman_ford_shortest_paths.hpp
View File

@@ -67,7 +67,7 @@ namespace boost {
class bellman_visitor {
public:
bellman_visitor() { }
bellman_visitor(Visitors vis = Visitors()) : m_vis(vis) { }
bellman_visitor(Visitors vis) : m_vis(vis) { }
template <class Edge, class Graph>
void examine_edge(Edge u, Graph& g) {
@@ -122,14 +122,19 @@ namespace boost {
typename GTraits::edge_iterator i, end;
for (Size k = 0; k < N; ++k)
for (Size k = 0; k < N; ++k) {
bool at_least_one_edge_relaxed = false;
for (tie(i, end) = edges(g); i != end; ++i) {
v.examine_edge(*i, g);
if (relax(*i, g, weight, pred, distance, combine, compare))
if (relax(*i, g, weight, pred, distance, combine, compare)) {
at_least_one_edge_relaxed = true;
v.edge_relaxed(*i, g);
else
} else
v.edge_not_relaxed(*i, g);
}
if (!at_least_one_edge_relaxed)
break;
}
for (tie(i, end) = edges(g); i != end; ++i)
if (compare(combine(get(distance, source(*i, g)),