sccstack.hh

// -*- 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);
 
      int index;
      acc_cond::mark_t condition;
 
      std::list<const state*> rem;
    };
 
    void push(int index);
 
    connected_component& top();
 
    const connected_component& top() const;
 
    void pop();
 
    size_t size() const;
 
    std::list<const state*>& rem();
 
    unsigned clear_rem();
 
    bool empty() const;
 
    typedef std::list<connected_component> stack_type;
    stack_type s;
  };
}