boostorg/graph
1
0
Fork 0
mirror of https://github.com/boostorg/graph.git synced 2026-07-21 13:23:42 +00:00
Code Issues Packages Projects Releases Wiki Activity

Use put instead of subscript operator in fill_random_max_flow_graph

Browse Source
This commit is contained in:
Sebastian Brockmeyer
2022-07-25 00:30:19 +02:00
parent fcfc152f85
commit 01020b0265
1 changed files with 4 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files
test/boykov_kolmogorov_max_flow_test.cpp
+4 -4
View File
@@ -72,7 +72,7 @@ fill_random_max_flow_graph(Graph& g, CapacityMap cap, ReverseEdgeMap rev,
// cannot use this, as we have no idea how properties are stored, right?
typename graph_traits< Graph >::edge_iterator ei, e_end;
for (boost::tie(ei, e_end) = edges(g); ei != e_end; ++ei)
cap[*ei] = int_gen();
put(cap, *ei, int_gen());
// get source and sink node
vertex_descriptor s = random_vertex(g, gen);
@@ -96,9 +96,9 @@ fill_random_max_flow_graph(Graph& g, CapacityMap cap, ReverseEdgeMap rev,
boost::tie(new_edge, inserted)
= add_edge(source_vertex, target_vertex, g);
assert(inserted);
rev[old_edge] = new_edge;
rev[new_edge] = old_edge;
cap[new_edge] = 0;
put(rev, old_edge, new_edge);
put(rev, new_edge, old_edge);
put(cap, new_edge, 0);
}
return std::make_pair(s, t);
}