23 #include <spot/twa/twa.hh>
47 std::list<const state*>
rem;
66 std::list<const state*>&
rem();
Stack of strongly connected components for the Tarjan-Couvreur emptiness-check algorithm.
Definition: sccstack.hh:31
void pop()
Pop the top SCC.
std::list< const state * > & rem()
The rem member of the top SCC.
std::list< connected_component > stack_type
SCC stack type.
Definition: sccstack.hh:76
connected_component & top()
Access the top SCC.
bool empty() const
Is the stack empty?
void push(int index)
Stack a new SCC with index index.
stack_type s
The underlying SCC stack storage.
Definition: sccstack.hh:77
const connected_component & top() const
Access the top SCC.
size_t size() const
How many SCC are in stack.
Definition: automata.hh:26
An acceptance mark.
Definition: acc.hh:76
A strongly connected component with its index, accumulated acceptance marks, and remaining states.
Definition: sccstack.hh:36
std::list< const state * > rem
Remaining states in this SCC.
Definition: sccstack.hh:47
int index
Index of the SCC.
Definition: sccstack.hh:42
connected_component(int index=-1)
Construct an SCC entry with the given index.
acc_cond::mark_t condition
Definition: sccstack.hh:45