spot  2.14.5
mcs.hh
1 // -*- coding: utf-8 -*-
2 // Copyright (C) by the Spot authors, see the AUTHORS file for details.
3 //
4 // This file is part of Spot, a model checking library.
5 //
6 // Spot is free software; you can redistribute it and/or modify it
7 // under the terms of the GNU General Public License as published by
8 // the Free Software Foundation; either version 3 of the License, or
9 // (at your option) any later version.
10 //
11 // Spot is distributed in the hope that it will be useful, but WITHOUT
12 // ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
13 // or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
14 // License for more details.
15 //
16 // You should have received a copy of the GNU General Public License
17 // along with this program. If not, see <http://www.gnu.org/licenses/>.
18 
19 #pragma once
20 
21 #include <spot/misc/common.hh>
22 #include <spot/twa/fwd.hh>
23 #include <vector>
24 
25 namespace spot
26 {
28  {
37  };
38 
39 
52  SPOT_API std::vector<unsigned>
53  maximum_cardinality_search(const const_twa_graph_ptr& a,
55 
60  SPOT_API twa_graph_ptr
63 }
Definition: automata.hh:26
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
Definition: mcs.hh:28
@ MCS_TIE_ANY
Break ties by picking the first possible state.
Definition: mcs.hh:30
@ MCS_TIE_SCC
Break ties by picking states from the "highest" SCCs.
Definition: mcs.hh:36
twa_graph_ptr maximum_cardinality_search_reorder_here(twa_graph_ptr a, mcs_tie_break tie=MCS_TIE_ANY)
Reorder the state of a according to the order computed by maximum_cardinality_search().

Please direct any question, comment, or bug report to the Spot mailing list at spot@lrde.epita.fr.
Generated on Fri Feb 27 2015 10:00:07 for spot by doxygen 1.9.1