mirror of
https://github.com/Z3Prover/z3
synced 2025-08-03 18:00:23 +00:00
Add a vector of edges to handle spanning trees
This commit is contained in:
parent
9f53a4aa18
commit
5a27c035e4
5 changed files with 129 additions and 109 deletions
|
@ -47,14 +47,14 @@ namespace smt {
|
|||
typedef int node;
|
||||
|
||||
public:
|
||||
virtual void initialize(svector<bool> const & upwards) {};
|
||||
virtual void initialize(svector<edge_id> const & tree) {};
|
||||
virtual void get_descendants(node start, svector<node> & descendants) {};
|
||||
|
||||
virtual void update(edge_id enter_id, edge_id leave_id, bool & is_swap_enter, bool & is_swap_leave) {};
|
||||
virtual bool check_well_formed() {UNREACHABLE(); return false;};
|
||||
virtual void update(edge_id enter_id, edge_id leave_id) {};
|
||||
virtual void get_path(node start, node end, svector<edge_id> & path, svector<bool> & against) {};
|
||||
virtual bool is_forward_edge(edge_id e_id) const {UNREACHABLE(); return false;};
|
||||
virtual bool is_ancestor_of(node ancestor, node child) {UNREACHABLE(); return false;};
|
||||
virtual bool in_subtree_t2(node child) {UNREACHABLE(); return false;};
|
||||
|
||||
virtual bool check_well_formed() {UNREACHABLE(); return false;};
|
||||
};
|
||||
}
|
||||
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue