21 #include <spot/misc/common.hh>
22 #include <spot/twa/fwd.hh>
56 SPOT_API std::vector<unsigned>
std::vector< unsigned > maximum_cardinality_search(const const_twa_graph_ptr &a, mcs_tie_break tie=MCS_TIE_ANY)
Return an ordering of the vertices computed by a maximum cardinality search.
mcs_tie_break
Tie-breaking strategy for maximum cardinality search.
Definition: mcs.hh:30
twa_graph_ptr maximum_cardinality_search_reorder_here(twa_graph_ptr a, mcs_tie_break tie=MCS_TIE_ANY)
Reorder the states of a according to the order computed by maximum_cardinality_search().
@ MCS_TIE_ANY
Break ties by picking the first possible state.
Definition: mcs.hh:32
@ MCS_TIE_SCC
Break ties by picking states from the "highest" SCCs.
Definition: mcs.hh:38
std::shared_ptr< twa_graph > twa_graph_ptr
Shared pointer to a mutable twa_graph.
Definition: fwd.hh:44
std::shared_ptr< const twa_graph > const_twa_graph_ptr
Shared pointer to a const twa_graph.
Definition: fwd.hh:38
Definition: automata.hh:26