#include <tgbaalgos/scc.hh>
Public Member Functions | |
std::ostream & | dump (std::ostream &out) const |
Public Attributes | |
unsigned | scc_total |
Total number of SCCs. | |
unsigned | acc_scc |
Total number of accepting SCC. | |
unsigned | dead_scc |
unsigned | acc_paths |
unsigned | dead_paths |
unsigned | self_loops |
std::vector< bool > | useless_scc_map |
A map of the useless SCCs. | |
bdd | useful_acc |
std::ostream& spot::scc_stats::dump | ( | std::ostream & | out | ) | const |
unsigned spot::scc_stats::acc_paths |
Number of maximal accepting paths.
An path is maximal and accepting if it ends in an accepting SCC that is only dead (i.e. non accepting) successors, or no successors at all.
unsigned spot::scc_stats::acc_scc |
Total number of accepting SCC.
unsigned spot::scc_stats::dead_paths |
Number of paths to a terminal dead SCC.
A terminal dead SCC is a dead SCC without successors.
unsigned spot::scc_stats::dead_scc |
Total number of dead SCC.
An SCC is dead if no accepting SCC is reachable from it. Note that an SCC can be neither dead nor accepting.
unsigned spot::scc_stats::scc_total |
Total number of SCCs.
unsigned spot::scc_stats::self_loops |
The set of useful acceptance conditions (i.e. acceptance conditions that are not always implied by other acceptance conditions).
std::vector<bool> spot::scc_stats::useless_scc_map |
A map of the useless SCCs.