22#include <spot/twaalgos/emptiness.hh>
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.
const state * search(const state *start, twa_run::steps &l)
Start the search from start, and append the resulting path (if any) to l.
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.
bfs_steps(const const_twa_ptr &a)
Construct a BFS helper for automaton a.
const_twa_ptr a_
The spot::tgba we are searching into.
Definition bfssteps.hh:97
Abstract class for states.
Definition twa.hh:49
std::shared_ptr< const twa > const_twa_ptr
Shared pointer to a const twa.
Definition fwd.hh:36
Definition automata.hh:26
Strict Weak Ordering for state pointers.
Definition twa.hh:128
A single step in a TωA run, pairing a state with an edge label and acceptance marks.
Definition emptiness.hh:384
std::list< step > steps
Ordered sequence of run steps.
Definition emptiness.hh:397