bfssteps.hh 4.05 KB
Newer Older
1
// -*- coding: utf-8 -*-
2
// Copyright (C) 2011, 2013, 2014 Laboratoire de Recherche et Developpement de
3
// l'Epita (LRDE).
4
// Copyright (C) 2004, 2005  Laboratoire d'Informatique de Paris 6 (LIP6),
5
// département Systèmes Répartis Coopératifs (SRC), Université Pierre
6 7 8 9 10 11
// 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
12
// the Free Software Foundation; either version 3 of the License, or
13 14 15 16 17 18 19 20
// (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
21
// along with this program.  If not, see <http://www.gnu.org/licenses/>.
22

23
#pragma once
24

25
#include <map>
26 27 28 29
#include "emptiness.hh"

namespace spot
{
30
  /// \ingroup tgba_misc
31
  /// \brief Make a BFS in a spot::tgba to compute a tgba_run::steps.
32 33 34 35
  ///
  /// This class should be used to compute the shortest path
  /// between a state of a spot::tgba and the first transition or
  /// state that matches some conditions.
36 37 38 39
  ///
  /// These conditions should be specified by defining bfs_steps::match()
  /// in a subclass.  Also the search can be restricted to some set of
  /// states with a proper definition of bfs_steps::filter().
40
  class SPOT_API bfs_steps
41 42
  {
  public:
43
    bfs_steps(const const_twa_ptr& a);
44 45
    virtual ~bfs_steps();

46 47 48 49 50 51
    /// \brief Start the search from \a start, and append the
    /// resulting path (if any) to \a l.
    ///
    /// \return the destination state of the last step (not included
    /// in \a l) if a matching path was found, or 0 otherwise.
    const state* search(const state* start, tgba_run::steps& l);
52

53 54 55 56 57
    /// \brief Return a state* that is unique for \a a.
    ///
    /// bfs_steps does not do handle the memory for the states it
    /// generates, this is the job of filter().  Here \a s is a new
    /// state* that search() has just allocated (using
58
    /// twa_succ_iterator::current_state()), and the return of this
59 60 61 62 63
    /// function should be a state* that does not need to be freed by
    /// search().
    ///
    /// If you already have a map or a set which uses states as keys,
    /// you should probably arrange for filter() to return these keys,
64 65
    /// and destroy \a s.  Otherwise you will have to define such a
    /// set, just to be able to destroy all the state* in a subclass.
66 67 68
    ///
    /// This function can return 0 if the given state should not be
    /// explored.
69 70
    virtual const state* filter(const state* s) = 0;

71 72 73 74 75 76 77 78 79 80 81 82 83 84 85
    /// \brief Whether a new transition completes a path.
    ///
    /// This function is called immediately after each call to
    /// filter() that does not return 0.
    ///
    /// \param step the source state (as returned by filter()), and the
    ///             labels of the outgoing transition
    /// \param dest the destination state (as returned by filter())
    /// \return true iff a path that included this step should be accepted.
    ///
    /// The search() algorithms stops as soon as match() returns true,
    /// and when this happens the list argument of search() is be
    /// augmented with the shortest past that ends with this
    /// transition.
    virtual bool match(tgba_run::step& step, const state* dest) = 0;
86

87 88 89 90 91 92 93 94 95 96 97
    /// \brief Append the resulting path to the resulting run.
    ///
    /// This is called after match() has returned true, to append the
    /// resulting path to \a l.  This seldom needs to be overridden,
    /// unless you do not want \a l to be updated (in which case an empty
    /// finalize() will do).
    virtual void finalize(const std::map<const state*, tgba_run::step,
			                 state_ptr_less_than>& father,
			  const tgba_run::step& s,
			  const state* start,
			  tgba_run::steps& l);
98

99
  protected:
100
    const_twa_ptr a_;		///< The spot::tgba we are searching into.
101
  };
102
}