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

Better documentation for the cycle enumeration algorithms.

Browse source 
* src/tgbaalgos/cycles.cc, src/tgbaalgos/cycles.hh,
src/tgbaalgos/isweakscc.hh: Improve .doc
* src/tgbaalgos/isweakscc.cc (weak_checker::cycle_found):
Scan the DFS backward so we only look at the cycle part.
This commit is contained in:
Alexandre Duret-Lutz 2012-09-21 11:15:12 +02:00
parent 420fcd62e4
commit 92e37998b2
4 changed files with 112 additions and 67 deletions
Download patch file Download diff file Expand all files Collapse all files

8
src/tgbaalgos/isweakscc.hh
View file

@ -30,14 +30,14 @@ namespace spot
/// \brief Whether the SCC number \a scc in \a aut is weak.
///
/// An SCC is weak if its cycles are all accepting, or the are all
/// non-accepting.
/// An SCC is weak if either its cycles are all accepting, or they
/// are all non-accepting.
///
/// The scc_map \a map should have been built already. The absence
/// of accepting cycle is easy to check (the scc_map can tell
/// whether the SCC is non-accepting already). For the accepting
/// SCC, this function works by enumerating all cycles in the given
/// SCC (it stops if it find a non-accepting cycle).
/// SCCs, this function enumerates all cycles in the given SCC (it
/// stops if it find a non-accepting cycle).
bool is_weak_scc(const tgba* aut, scc_map& map, unsigned scc);
/// @}