sccstack.hh 2.1 KB
Newer Older
1
// -*- coding: utf-8 -*-
2
// Copyright (C) 2013, 2014  Laboratoire de Recherche et Développement de
3
// l'Epita (LRDE).
4
// Copyright (C) 2004, 2005  Laboratoire d'Informatique de Paris 6 (LIP6),
5
// département Systèmes Répartis Coopératifs (SRC), Université Pierre
6
7
8
9
10
11
// et Marie Curie.
//
// This file is part of Spot, a model checking library.
//
// Spot is free software; you can redistribute it and/or modify it
// under the terms of the GNU General Public License as published by
12
// the Free Software Foundation; either version 3 of the License, or
13
14
15
16
17
18
19
20
// (at your option) any later version.
//
// Spot is distributed in the hope that it will be useful, but WITHOUT
// ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
// or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public
// License for more details.
//
// You should have received a copy of the GNU General Public License
21
// along with this program.  If not, see <http://www.gnu.org/licenses/>.
22

23
#pragma once
24

25
#include <bddx.h>
26
#include <list>
27
#include "twa/twa.hh"
28
29
30
31
32

namespace spot
{
  // A stack of Strongly-Connected Components, as needed by the
  // Tarjan-Couvreur algorithm.
33
  class SPOT_API scc_stack
34
35
36
37
38
39
40
41
42
  {
  public:
    struct connected_component
    {
    public:
      connected_component(int index = -1);

      /// Index of the SCC.
      int index;
43
44
45
      /// The union of all acceptance marks of transitions the
      /// connected component.
      acc_cond::mark_t condition;
46
47

      std::list<const state*> rem;
48
49
50
51
52
53
54
55
    };

    /// Stack a new SCC with index \a index.
    void push(int index);

    /// Access the top SCC.
    connected_component& top();

56
57
58
    /// Access the top SCC.
    const connected_component& top() const;

59
60
61
62
63
64
    /// Pop the top SCC.
    void pop();

    /// How many SCC are in stack.
    size_t size() const;

65
66
67
68
69
70
71
72
    /// The \c rem member of the top SCC.
    std::list<const state*>& rem();

    /// Purge all \c rem members.
    ///
    /// \return the number of elements cleared.
    unsigned clear_rem();

73
74
75
    /// Is the stack empty?
    bool empty() const;

76
    typedef std::list<connected_component> stack_type;
77
78
79
    stack_type s;
  };
}