Stack of strongly connected components for the Tarjan-Couvreur emptiness-check algorithm.
More...
#include <spot/twaalgos/gtec/sccstack.hh>
|
| struct | connected_component |
| | A strongly connected component with its index, accumulated acceptance marks, and remaining states. More...
|
| |
Stack of strongly connected components for the Tarjan-Couvreur emptiness-check algorithm.
◆ stack_type
◆ clear_rem()
| unsigned spot::scc_stack::clear_rem |
( |
| ) |
|
Purge all rem members.
- Returns
- the number of elements cleared.
◆ empty()
| bool spot::scc_stack::empty |
( |
| ) |
const |
◆ pop()
| void spot::scc_stack::pop |
( |
| ) |
|
◆ push()
| void spot::scc_stack::push |
( |
int |
index | ) |
|
Stack a new SCC with index index.
◆ rem()
| std::list< const state * > & spot::scc_stack::rem |
( |
| ) |
|
The rem member of the top SCC.
◆ size()
| size_t spot::scc_stack::size |
( |
| ) |
const |
How many SCC are in stack.
◆ top() [1/2]
◆ top() [2/2]
The underlying SCC stack storage.
The documentation for this class was generated from the following file: