spot  2.16
sccstack.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 <bddx.h>
22 #include <list>
23 #include <spot/twa/twa.hh>
24 
25 namespace spot
26 {
30  class SPOT_API scc_stack
31  {
32  public:
36  {
37  public:
39  connected_component(int index = -1);
40 
42  int index;
46 
47  std::list<const state*> rem;
48  };
49 
51  void push(int index);
52 
55 
57  const connected_component& top() const;
58 
60  void pop();
61 
63  size_t size() const;
64 
66  std::list<const state*>& rem();
67 
71  unsigned clear_rem();
72 
74  bool empty() const;
75 
76  typedef std::list<connected_component> stack_type;
78  };
79 }
Stack of strongly connected components for the Tarjan-Couvreur emptiness-check algorithm.
Definition: sccstack.hh:31
void pop()
Pop the top SCC.
std::list< const state * > & rem()
The rem member of the top SCC.
std::list< connected_component > stack_type
SCC stack type.
Definition: sccstack.hh:76
unsigned clear_rem()
connected_component & top()
Access the top SCC.
bool empty() const
Is the stack empty?
void push(int index)
Stack a new SCC with index index.
stack_type s
The underlying SCC stack storage.
Definition: sccstack.hh:77
const connected_component & top() const
Access the top SCC.
size_t size() const
How many SCC are in stack.
Definition: automata.hh:26
An acceptance mark.
Definition: acc.hh:76
A strongly connected component with its index, accumulated acceptance marks, and remaining states.
Definition: sccstack.hh:36
std::list< const state * > rem
Remaining states in this SCC.
Definition: sccstack.hh:47
int index
Index of the SCC.
Definition: sccstack.hh:42
connected_component(int index=-1)
Construct an SCC entry with the given index.
acc_cond::mark_t condition
Definition: sccstack.hh:45

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