19 #ifndef SPOT_FASTTGBAALGOS_EC_UNION_SCC_HH
20 # define SPOT_FASTTGBAALGOS_EC_UNION_SCC_HH
24 #include "misc/hash.hh"
25 #include "union_find.hh"
26 #include "fasttgba/fasttgba.hh"
28 #include "root_stack.hh"
50 std::string extra_info_csv();
65 virtual void dfs_pop();
87 std::vector<pair_state_iter>
todo;
111 #endif // SPOT_FASTTGBAALGOS_EC_UNION_SCC_HH
Definition: fasttgba.hh:33
int update_loop_cpt_
count UPDATE loop iterations
Definition: union_scc.hh:101
This class act as an interface for all classes.
Definition: fasttgba_state.hh:30
Abstract class for states.
Definition: state.hh:40
unsigned int max_dfs_size_
keep peack size
Definition: union_scc.hh:99
bool counterexample_found
the automaton that will be used for the Emptiness check
Definition: union_scc.hh:74
std::vector< pair_state_iter > todo
the todo stack
Definition: union_scc.hh:87
Definition: union_scc.hh:36
A simple wrapper for an automaton.
Definition: ec.hh:40
Definition: root_stack.hh:35
Iterate over the successors of a state.
Definition: fasttgba_succ_iterator.hh:35
int roots_poped_cpt_
count UPDATE loop iterations
Definition: union_scc.hh:102
int memory_cost_
evaluates memory
Definition: union_scc.hh:105
stack_of_roots * roots_stack_
Root of stack.
Definition: union_scc.hh:90
int transitions_cpt_
count transitions
Definition: union_scc.hh:104
Definition: union_scc.hh:80
union_find * uf
the union_find used for the storage
Definition: union_scc.hh:93
This class represents a set of acceptance marks.
Definition: markset.hh:35
int K
constant to evaluate cost
Definition: union_scc.hh:107
Definition: union_find.hh:46
const instance_automaton * inst
The instance automaton.
Definition: union_scc.hh:96
int trivial_scc_
count trivial SCCs
Definition: union_scc.hh:106
int states_cpt_
count states
Definition: union_scc.hh:103
int update_cpt_
count UPDATE calls
Definition: union_scc.hh:100