bfssteps.hh

// -*- coding: utf-8 -*-
// Copyright (C) 2011, 2013, 2014, 2018 Laboratoire de Recherche et
// Developpement 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 <map>
#include <spot/twaalgos/emptiness.hh>
 
namespace spot
{
  class SPOT_API bfs_steps
  {
  public:
    bfs_steps(const const_twa_ptr& a);
    virtual ~bfs_steps();
 
    const state* search(const state* start, twa_run::steps& l);
 
    virtual const state* filter(const state* s) = 0;
 
    virtual bool match(twa_run::step& step, const state* dest) = 0;
 
    virtual void finalize(const std::map<const state*, twa_run::step,
                                         state_ptr_less_than>& father,
                          const twa_run::step& s,
                          const state* start,
                          twa_run::steps& l);
 
  protected:
    const_twa_ptr a_;                
  };
}