spot  2.12.1
bfssteps.hh
1 // -*- coding: utf-8 -*-
2 // Copyright (C) by the Spot authors, see the AUTHORS file for details.
3 //
4 // This file is part of Spot, a model checking library.
5 //
6 // Spot is free software; you can redistribute it and/or modify it
7 // under the terms of the GNU General Public License as published by
8 // the Free Software Foundation; either version 3 of the License, or
9 // (at your option) any later version.
10 //
11 // Spot is distributed in the hope that it will be useful, but WITHOUT
12 // ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
13 // or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
14 // License for more details.
15 //
16 // You should have received a copy of the GNU General Public License
17 // along with this program. If not, see <http://www.gnu.org/licenses/>.
18 
19 #pragma once
20 
21 #include <map>
22 #include <spot/twaalgos/emptiness.hh>
23 
24 namespace spot
25 {
36  class SPOT_API bfs_steps
37  {
38  public:
39  bfs_steps(const const_twa_ptr& a);
40  virtual ~bfs_steps();
41 
47  const state* search(const state* start, twa_run::steps& l);
48 
65  virtual const state* filter(const state* s) = 0;
66 
81  virtual bool match(twa_run::step& step, const state* dest) = 0;
82 
89  virtual void finalize(const std::map<const state*, twa_run::step,
90  state_ptr_less_than>& father,
91  const twa_run::step& s,
92  const state* start,
93  twa_run::steps& l);
94 
95  protected:
96  const_twa_ptr a_;
97  };
98 }
Make a BFS in a spot::tgba to compute a twa_run::steps.
Definition: bfssteps.hh:37
virtual const state * filter(const state *s)=0
Return a state* that is unique for a.
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)
Append the resulting path to the resulting run.
virtual bool match(twa_run::step &step, const state *dest)=0
Whether a new transition completes a path.
const state * search(const state *start, twa_run::steps &l)
Start the search from start, and append the resulting path (if any) to l.
const_twa_ptr a_
The spot::tgba we are searching into.
Definition: bfssteps.hh:96
Abstract class for states.
Definition: twa.hh:47
Definition: automata.hh:26
Strict Weak Ordering for state*.
Definition: twa.hh:124
Definition: emptiness.hh:373

Please direct any question, comment, or bug report to the Spot mailing list at spot@lrde.epita.fr.
Generated on Fri Feb 27 2015 10:00:07 for spot by doxygen 1.9.1