alarsyo/spot
1
0
Fork 0
Code Issues Pull requests Projects Releases Wiki Activity

* src/tgbaalgos/gtec/gtec.hh (couvreur99_check): Document poprem.

Browse source
This commit is contained in:
Alexandre Duret-Lutz 2005-01-29 00:07:21 +00:00
parent 29548f695d
commit de472c74b4
2 changed files with 11 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

2
ChangeLog
View file

@ -1,5 +1,7 @@
2005-01-29 Alexandre Duret-Lutz <adl@gnu.org> 2005-01-29 Alexandre Duret-Lutz <adl@gnu.org>
* src/tgbaalgos/gtec/gtec.hh (couvreur99_check): Document poprem.
* bench/emptchk/README: Make clearer that spin is needed. * bench/emptchk/README: Make clearer that spin is needed.
* src/tgbatest/randtgba.cc (syntax): Missing std::endl. * src/tgbatest/randtgba.cc (syntax): Missing std::endl.

9
src/tgbaalgos/gtec/gtec.hh
View file

@ -73,6 +73,15 @@ namespace spot
/// tgba_succ_iterators: it must compute all successors of a state /// tgba_succ_iterators: it must compute all successors of a state
/// at once in order to decide which to explore first, and must keep /// at once in order to decide which to explore first, and must keep
/// a list of all unexplored successors in its DFS stack. /// a list of all unexplored successors in its DFS stack.
///
/// The \c poprem parameter specifies how the algorithm should
/// handle the destruction of non-accepting maximal strongly
/// connected components. If \c poprem is true, the algorithm will
/// keep a list of all states of a SCC that are fully processed and
/// should be removed once the MSCC is popped. If \c poprem is
/// false, the MSCC will be traversed again (i.e. generating the
/// successors of the root recursively) for deletion. This is
/// a choice between memory and speed.
class couvreur99_check: public emptiness_check, public ec_statistics class couvreur99_check: public emptiness_check, public ec_statistics
{ {
public: public: