reachiter.hh

// -*- coding: utf-8 -*-
// Copyright (C) by the Spot authors, see the AUTHORS file for details.
//
// 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 <spot/misc/hash.hh>
#include <spot/twa/twa.hh>
#include <stack>
#include <deque>
 
namespace spot
{
  class SPOT_API twa_reachable_iterator
  {
  public:
    twa_reachable_iterator(const const_twa_ptr& a);
    virtual ~twa_reachable_iterator();
 
    virtual void run();
 
    virtual void add_state(const state* s) = 0;
    virtual const state* next_state() = 0;
 
    virtual bool want_state(const state* s) const;
 
    virtual void start();
    virtual void end();
 
    virtual void process_state(const state* s, int n, twa_succ_iterator* si);
    virtual void process_link(const state* in_s, int in,
                              const state* out_s, int out,
                              const twa_succ_iterator* si);
 
  protected:
    const_twa_ptr aut_;        
 
    state_map<int> seen;        
  };
 
  class SPOT_API twa_reachable_iterator_breadth_first :
    public twa_reachable_iterator
  {
  public:
    twa_reachable_iterator_breadth_first(const const_twa_ptr& a);
 
    virtual void add_state(const state* s) override;
    virtual const state* next_state() override;
 
  protected:
    std::deque<const state*> todo; 
  };
 
  class SPOT_API twa_reachable_iterator_depth_first
  {
  public:
    twa_reachable_iterator_depth_first(const const_twa_ptr& a);
    virtual ~twa_reachable_iterator_depth_first();
 
    virtual void run();
 
    virtual bool want_state(const state* s) const;
 
    virtual void start();
    virtual void end();
 
    virtual void process_state(const state* s, int n, twa_succ_iterator* si);
    virtual void process_link(const state* in_s, int in,
                              const state* out_s, int out,
                              const twa_succ_iterator* si);
 
  protected:
    const_twa_ptr aut_;                
 
    state_map<int> seen;        
    struct stack_item
    {
      const state* src;
      int src_n;
      twa_succ_iterator* it;
    };
    std::deque<stack_item> todo; 
 
    virtual void push(const state* s, int sn);
    virtual void pop();
  };
 
  class twa_reachable_iterator_depth_first_stack
    : public twa_reachable_iterator_depth_first
  {
  public:
    twa_reachable_iterator_depth_first_stack(const const_twa_ptr& a);
    bool on_stack(int sn) const;
  protected:
    virtual void push(const state* s, int sn) override;
    virtual void pop() override;
 
    std::unordered_set<int> stack_;
  };
}