mirror of
https://github.com/Z3Prover/z3
synced 2025-05-11 09:44:43 +00:00
Use constraint graphs for minimum cost flow correctly
This commit is contained in:
parent
637b63cbe1
commit
1a32a64b96
3 changed files with 85 additions and 44 deletions
|
@ -933,7 +933,7 @@ public:
|
|||
return found;
|
||||
}
|
||||
|
||||
// Return true if there is an edge source --> target.
|
||||
// Return true if there is an edge source --> target (also counting disabled edges).
|
||||
// If there is such edge, return its edge_id in parameter id.
|
||||
bool get_edge_id(dl_var source, dl_var target, edge_id & id) {
|
||||
edge_id_vector & edges = m_out_edges[source];
|
||||
|
@ -942,7 +942,7 @@ public:
|
|||
for (; it != end; ++it) {
|
||||
id = *it;
|
||||
edge & e = m_edges[id];
|
||||
if (e.is_enabled() && e.get_target() == target) {
|
||||
if (e.get_target() == target) {
|
||||
return true;
|
||||
}
|
||||
}
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue