f120dd3206
* NEWS: Mention the change. * src/: Rename as ... * spot/: ... this, adjust all headers to include <spot/...> instead of "...", and adjust all Makefile.am to search headers from the top-level directory. * HACKING: Add conventions about #include. * spot/sanity/style.test: Add a few more grep to catch cases that do not follow these conventions. * .gitignore, Makefile.am, README, bench/stutter/Makefile.am, bench/stutter/stutter_invariance_formulas.cc, bench/stutter/stutter_invariance_randomgraph.cc, configure.ac, debian/rules, doc/Doxyfile.in, doc/Makefile.am, doc/org/.dir-locals.el.in, doc/org/g++wrap.in, doc/org/init.el.in, doc/org/tut01.org, doc/org/tut02.org, doc/org/tut03.org, doc/org/tut10.org, doc/org/tut20.org, doc/org/tut21.org, doc/org/tut22.org, doc/org/tut30.org, iface/ltsmin/Makefile.am, iface/ltsmin/kripke.test, iface/ltsmin/ltsmin.cc, iface/ltsmin/ltsmin.hh, iface/ltsmin/modelcheck.cc, wrap/python/Makefile.am, wrap/python/ajax/spotcgi.in, wrap/python/spot_impl.i, wrap/python/tests/ltl2tgba.py, wrap/python/tests/randgen.py, wrap/python/tests/run.in: Adjust.
79 lines
2.1 KiB
C++
79 lines
2.1 KiB
C++
// -*- coding: utf-8 -*-
|
|
// Copyright (C) 2013, 2014 Laboratoire de Recherche et Développement de
|
|
// l'Epita (LRDE).
|
|
// Copyright (C) 2004, 2005 Laboratoire d'Informatique de Paris 6 (LIP6),
|
|
// département Systèmes Répartis Coopératifs (SRC), Université Pierre
|
|
// 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
|
|
// the Free Software Foundation; either version 3 of the License, or
|
|
// (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
|
|
// along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
#pragma once
|
|
|
|
#include <bddx.h>
|
|
#include <list>
|
|
#include <spot/twa/twa.hh>
|
|
|
|
namespace spot
|
|
{
|
|
// A stack of Strongly-Connected Components, as needed by the
|
|
// Tarjan-Couvreur algorithm.
|
|
class SPOT_API scc_stack
|
|
{
|
|
public:
|
|
struct connected_component
|
|
{
|
|
public:
|
|
connected_component(int index = -1);
|
|
|
|
/// Index of the SCC.
|
|
int index;
|
|
/// The union of all acceptance marks of transitions the
|
|
/// connected component.
|
|
acc_cond::mark_t condition;
|
|
|
|
std::list<const state*> rem;
|
|
};
|
|
|
|
/// Stack a new SCC with index \a index.
|
|
void push(int index);
|
|
|
|
/// Access the top SCC.
|
|
connected_component& top();
|
|
|
|
/// Access the top SCC.
|
|
const connected_component& top() const;
|
|
|
|
/// Pop the top SCC.
|
|
void pop();
|
|
|
|
/// How many SCC are in stack.
|
|
size_t size() const;
|
|
|
|
/// 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();
|
|
|
|
/// Is the stack empty?
|
|
bool empty() const;
|
|
|
|
typedef std::list<connected_component> stack_type;
|
|
stack_type s;
|
|
};
|
|
}
|