mirror of
https://github.com/Z3Prover/z3
synced 2025-04-29 03:45:51 +00:00
First complete version of Network Simplex
This commit is contained in:
parent
e715ccbc98
commit
b67d333cf9
6 changed files with 105 additions and 71 deletions
|
@ -35,6 +35,12 @@ Notes:
|
|||
|
||||
namespace smt {
|
||||
|
||||
template<typename T>
|
||||
std::string pp_vector(std::string const & label, svector<T> v, bool has_header = false);
|
||||
|
||||
template<typename T>
|
||||
std::string pp_vector(std::string const & label, vector<T> v, bool has_header = false);
|
||||
|
||||
// Solve minimum cost flow problem using Network Simplex algorithm
|
||||
template<typename Ext>
|
||||
class network_flow : private Ext {
|
||||
|
@ -102,9 +108,6 @@ namespace smt {
|
|||
|
||||
void update_spanning_tree();
|
||||
|
||||
std::string pp_vector(std::string const & label, svector<int> v, bool has_header = false);
|
||||
std::string pp_vector(std::string const & label, vector<numeral> v, bool has_header = false);
|
||||
|
||||
public:
|
||||
|
||||
network_flow(graph & g, vector<fin_numeral> const & balances);
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue