mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-04-29 03:45:51 +00:00
Code Activity

Use constraint graphs for minimum cost flow correctly

Browse source
This commit is contained in:
Anh-Dung Phan 2013-10-31 12:11:56 -07:00
parent 637b63cbe1
commit 1a32a64b96
3 changed files with 85 additions and 44 deletions
Download patch file Download diff file Expand all files Collapse all files

5
src/smt/network_flow.h
View file

@ -66,14 +66,15 @@ namespace smt {
svector<edge_state> m_states;
// An element is true if the corresponding edge points upwards (compared to the root node)
// m_upwards[i] is true if the corresponding edge
// (i, m_pred[i]) points upwards (pointing toward the root node)
svector<bool> m_upwards;
// Store the parent of a node i in the spanning tree
svector<node> m_pred;
// Store the number of edge on the path from node i to the root
svector<int> m_depth;
// Store the pointer from node i to the next node in depth first search ordering
// Store the pointer from node i to the next node in depth-first search order
svector<node> m_thread;
// Reverse orders of m_thread
svector<node> m_rev_thread;