21 #include <spot/twaalgos/gtec/sccstack.hh>
22 #include <spot/twa/twa.hh>
The status of the emptiness-check on success.
Definition: status.hh:34
int states() const
Return the number of states visited by the search.
void print_stats(std::ostream &os) const
Output statistics about this object.
const_twa_ptr aut
The automaton being checked.
Definition: status.hh:41
scc_stack root
Stack of SCCs found during DFS.
Definition: status.hh:42
state_map< int > h
Map from state to its DFS order number.
Definition: status.hh:44
const state * cycle_seed
Seed state for the accepting cycle.
Definition: status.hh:46
couvreur99_check_status(const const_twa_ptr &aut)
Construct a status object for the given automaton.
Stack of strongly connected components for the Tarjan-Couvreur emptiness-check algorithm.
Definition: sccstack.hh:31
Abstract class for states.
Definition: twa.hh:49
std::shared_ptr< const twa > const_twa_ptr
Shared pointer to a const twa.
Definition: fwd.hh:36
Definition: automata.hh:26
std::unordered_map< const state *, val, state_ptr_hash, state_ptr_equal > state_map
Unordered map of abstract states.
Definition: twa.hh:204