* src/tgbaalgos/emptinesscheck.hh, src/tgbaalgos/emptinesscheck.cc:
Delete and split into ... * src/tgbaalgos/gtec/ce.cc, src/tgbaalgos/gtec/ce.hh, src/tgbaalgos/gtec/explscc.cc, src/tgbaalgos/gtec/explscc.hh, src/tgbaalgos/gtec/gtec.cc, src/tgbaalgos/gtec/gtec.hh, src/tgbaalgos/gtec/nsheap.cc, src/tgbaalgos/gtec/nsheap.hh, src/tgbaalgos/gtec/sccstack.cc, src/tgbaalgos/gtec/sccstack.hh, src/tgbaalgos/gtec/status.cc, src/tgbaalgos/gtec/status.hh: ... these new files. * src/tgbaalgos/gtec/Makefile.am: New file. * src/tgbaalgos/Makefile.am (SUBDIRS, libtgbaalgos_la_LIBADD): Recurse into gtec and link gtec/libgtec.la. (tgbaalgos_HEADERS, libtgbaalgos_la_SOURCES): Remove emptinesscheck.hh and emptinesscheck.cc. * configure.ac: Output src/tgbalagos/gtec/Makefile. * iface/gspn/ltlgspn.cc, src/tgbatest/ltl2tgba.cc: Update includes. * README: Update tree description.
This commit is contained in:
parent
d8f5bf608a
commit
579c343e13
22 changed files with 1738 additions and 1342 deletions
67
src/tgbaalgos/gtec/sccstack.hh
Normal file
67
src/tgbaalgos/gtec/sccstack.hh
Normal file
|
|
@ -0,0 +1,67 @@
|
|||
// Copyright (C) 2004 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 2 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 Spot; see the file COPYING. If not, write to the Free
|
||||
// Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
|
||||
// 02111-1307, USA.
|
||||
|
||||
#ifndef SPOT_TGBAALGOS_GTEC_SCCSTACK_HH
|
||||
# define SPOT_TGBAALGOS_GTEC_SCCSTACK_HH
|
||||
|
||||
#include <stack>
|
||||
#include <bdd.h>
|
||||
|
||||
namespace spot
|
||||
{
|
||||
// A stack of Strongly-Connected Components, as needed by the
|
||||
// Tarjan-Couvreur algorithm.
|
||||
class scc_stack
|
||||
{
|
||||
public:
|
||||
struct connected_component
|
||||
{
|
||||
public:
|
||||
connected_component(int index = -1);
|
||||
|
||||
/// Index of the SCC.
|
||||
int index;
|
||||
/// The bdd condition is the union of all acceptance conditions of
|
||||
/// transitions which connect the states of the connected component.
|
||||
bdd condition;
|
||||
};
|
||||
|
||||
/// Stack a new SCC with index \a index.
|
||||
void push(int index);
|
||||
|
||||
/// Access the top SCC.
|
||||
connected_component& top();
|
||||
|
||||
/// Pop the top SCC.
|
||||
void pop();
|
||||
|
||||
/// How many SCC are in stack.
|
||||
size_t size() const;
|
||||
|
||||
/// Is the stack empty?
|
||||
bool empty() const;
|
||||
|
||||
typedef std::stack<connected_component> stack_type;
|
||||
stack_type s;
|
||||
};
|
||||
}
|
||||
|
||||
#endif // SPOT_TGBAALGOS_GTEC_SCCSTACK_HH
|
||||
Loading…
Add table
Add a link
Reference in a new issue