22 #include <spot/twaalgos/sccinfo.hh> 23 #include <spot/twa/twagraph.hh> 89 highlight_semidet_sccs(scc_info& si,
unsigned color);
96 is_complete(
const const_twa_graph_ptr& aut);
103 is_semi_deterministic(
const const_twa_graph_ptr& aut);
106 SPOT_API std::vector<bool>
107 semidet_sccs(scc_info& si);
111 SPOT_API
void check_determinism(twa_graph_ptr aut);
124 count_univbranch_states(
const const_twa_graph_ptr& aut);
140 count_univbranch_edges(
const const_twa_graph_ptr& aut);
Definition: automata.hh:26
bool is_deterministic(const const_twa_graph_ptr &aut)
Return true iff aut is deterministic.
void highlight_nondet_edges(twa_graph_ptr &aut, unsigned color)
Highlight nondeterministic edges.
unsigned count_nondet_states(const const_twa_graph_ptr &aut)
Count the number of states with non-deterministic branching in aut.
bool is_universal(const const_twa_graph_ptr &aut)
Return true iff aut is universal.
void highlight_nondet_states(twa_graph_ptr &aut, unsigned color)
Highlight nondeterministic states.