Storage for SCC related information.
More...
#include <spot/twaalgos/sccinfo.hh>
|
| typedef std::vector< unsigned > | scc_succs |
| | List of successor SCC indices.
|
| |
|
| | scc_info_node () noexcept |
| | Default-construct an empty trivial SCC node.
|
| |
| | scc_info_node (acc_cond::mark_t acc, acc_cond::mark_t common, bool trivial) noexcept |
| | Construct an SCC node with given acceptance information.
|
| |
| bool | is_trivial () const |
| | True if the SCC has no cycle.
|
| |
| bool | is_accepting () const |
| | True if we know that the SCC has an accepting cycle.
|
| |
| bool | is_rejecting () const |
| | True if we know that all cycles in the SCC are rejecting.
|
| |
| bool | is_useful () const |
| | True if the SCC can reach an accepting SCC.
|
| |
| acc_cond::mark_t | acc_marks () const |
| | Return the union of all acceptance marks in this SCC.
|
| |
| acc_cond::mark_t | common_marks () const |
| | Return the marks common to all transitions in this SCC.
|
| |
| const std::vector< unsigned > & | states () const |
| | Return all states belonging to this SCC.
|
| |
| unsigned | one_state () const |
| | Return one arbitrary state in this SCC.
|
| |
| const scc_succs & | succ () const |
| | Return the list of successor SCC indices.
|
| |
Storage for SCC related information.
◆ scc_succs
List of successor SCC indices.
◆ scc_info_node() [1/2]
| spot::scc_info_node::scc_info_node |
( |
| ) |
|
|
inlinenoexcept |
Default-construct an empty trivial SCC node.
◆ scc_info_node() [2/2]
Construct an SCC node with given acceptance information.
◆ acc_marks()
Return the union of all acceptance marks in this SCC.
◆ common_marks()
Return the marks common to all transitions in this SCC.
◆ is_accepting()
| bool spot::scc_info_node::is_accepting |
( |
| ) |
const |
|
inline |
True if we know that the SCC has an accepting cycle.
Note that both is_accepting() and is_rejecting() may return false if an SCC intersects a mix of Fin and Inf sets. Call determine_unknown_acceptance() to decide.
◆ is_rejecting()
| bool spot::scc_info_node::is_rejecting |
( |
| ) |
const |
|
inline |
True if we know that all cycles in the SCC are rejecting.
Note that both is_accepting() and is_rejecting() may return false if an SCC intersects a mix of Fin and Inf sets. Call determine_unknown_acceptance() to decide.
◆ is_trivial()
| bool spot::scc_info_node::is_trivial |
( |
| ) |
const |
|
inline |
True if the SCC has no cycle.
◆ is_useful()
| bool spot::scc_info_node::is_useful |
( |
| ) |
const |
|
inline |
True if the SCC can reach an accepting SCC.
◆ one_state()
| unsigned spot::scc_info_node::one_state |
( |
| ) |
const |
|
inline |
Return one arbitrary state in this SCC.
◆ states()
| const std::vector< unsigned > & spot::scc_info_node::states |
( |
| ) |
const |
|
inline |
Return all states belonging to this SCC.
◆ succ()
| const scc_succs & spot::scc_info_node::succ |
( |
| ) |
const |
|
inline |
Return the list of successor SCC indices.
◆ acc_
Union of acceptance marks seen.
◆ accepting_
| bool spot::scc_info_node::accepting_ |
|
protected |
True if the SCC is necessarily accepting.
◆ common_
Marks common to all edges.
◆ one_state_
| unsigned spot::scc_info_node::one_state_ |
|
protected |
An arbitrary state in this SCC.
◆ rejecting_
| bool spot::scc_info_node::rejecting_ |
|
protected |
True if the SCC is necessarily rejecting.
◆ states_
| std::vector<unsigned> spot::scc_info_node::states_ |
|
protected |
◆ succ_
Successor SCCs of this SCC.
◆ trivial_
| bool spot::scc_info_node::trivial_ |
|
protected |
True if the SCC has no cycle.
◆ useful_
| bool spot::scc_info_node::useful_ |
|
protected |
True if the SCC can reach an accepting SCC.
The documentation for this class was generated from the following file:
