|
| twa_graph (const bdd_dict_ptr &dict) |
|
| twa_graph (const const_twa_graph_ptr &other, prop_set p) |
|
template<typename State_Name , typename Name_Hash = std::hash<State_Name>, typename Name_Equal = std::equal_to<State_Name>> |
namer< State_Name, Name_Hash, Name_Equal > * | create_namer () |
|
namer< formula > * | create_formula_namer () |
|
void | release_formula_namer (namer< formula > *namer, bool keep_names) |
|
graph_t & | get_graph () |
|
const graph_t & | get_graph () const |
|
unsigned | num_states () const |
|
unsigned | num_edges () const |
|
void | set_init_state (state_num s) |
|
void | set_init_state (const state *s) |
|
state_num | get_init_state_number () const |
|
virtual const twa_graph_state * | get_init_state () const |
| Get the initial state of the automaton. More...
|
|
virtual twa_succ_iterator * | succ_iter (const state *st) const |
| Get an iterator over the successors of local_state. More...
|
|
state_num | state_number (const state *st) const |
|
const twa_graph_state * | state_from_number (state_num n) const |
|
std::string | format_state (unsigned n) const |
|
virtual std::string | format_state (const state *st) const |
|
twa_graph_edge_data & | edge_data (const twa_succ_iterator *it) |
|
twa_graph_edge_data & | edge_data (unsigned t) |
|
const twa_graph_edge_data & | edge_data (const twa_succ_iterator *it) const |
|
const twa_graph_edge_data & | edge_data (unsigned t) const |
|
edge_storage_t & | edge_storage (const twa_succ_iterator *it) |
|
edge_storage_t & | edge_storage (unsigned t) |
|
const edge_storage_t | edge_storage (const twa_succ_iterator *it) const |
|
const edge_storage_t | edge_storage (unsigned t) const |
|
unsigned | new_state () |
|
unsigned | new_states (unsigned n) |
|
unsigned | new_edge (unsigned src, unsigned dst, bdd cond, acc_cond::mark_t acc=0U) |
|
unsigned | new_acc_edge (unsigned src, unsigned dst, bdd cond, bool acc=true) |
|
internal::state_out< const graph_t > | out (unsigned src) const |
|
internal::state_out< graph_t > | out (unsigned src) |
|
auto | states () const -> decltype(g_.states()) |
|
auto | states () -> decltype(g_.states()) |
|
auto | edges () const -> decltype(g_.edges()) |
|
auto | edges () -> decltype(g_.edges()) |
|
auto | edge_vector () const -> decltype(g_.edge_vector()) |
|
auto | edge_vector () -> decltype(g_.edge_vector()) |
|
auto | is_dead_edge (const graph_t::edge_storage_t &t) const -> decltype(g_.is_dead_edge(t)) |
|
virtual bdd | compute_support_conditions (const state *s) const |
|
void | merge_edges () |
|
void | purge_dead_states () |
| Remove all states without successors. More...
|
|
void | purge_unreachable_states () |
| Remove all unreachable states. More...
|
|
acc_cond::mark_t | state_acc_sets (unsigned s) const |
|
bool | state_is_accepting (unsigned s) const |
|
bool | state_is_accepting (const state *s) const |
|
bool | operator== (const twa_graph &aut) const |
|
void | defrag_states (std::vector< unsigned > &&newst, unsigned used_states) |
|