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

* src/tgbaalgos/tau03opt.hh, src/tgbaalgos/se05.hh: Correct

Browse source 
pseudo-code.  From Denis.
This commit is contained in:
Alexandre Duret-Lutz 2005-01-24 18:57:08 +00:00
parent 42bc594193
commit 1072b2dd99
3 changed files with 16 additions and 13 deletions
Download patch file Download diff file Expand all files Collapse all files

3
ChangeLog
View file

@ -1,5 +1,8 @@
2005-01-24 Alexandre Duret-Lutz <adl@src.lip6.fr>
* src/tgbaalgos/tau03opt.hh, src/tgbaalgos/se05.hh: Correct
pseudo-code. From Denis.
* src/tgbaalgos/gtec/gtec.cc: Fake statistics count to match
how the algorithm will behave once remove_component() is revamped.

5
src/tgbaalgos/se05.hh
View file

@ -1,4 +1,4 @@
// Copyright (C) 2004 Laboratoire d'Informatique de Paris 6 (LIP6),
// Copyright (C) 2004, 2005 Laboratoire d'Informatique de Paris 6 (LIP6),
// département Systèmes Répartis Coopératifs (SRC), Université Pierre
// et Marie Curie.
//
@ -61,7 +61,8 @@ namespace spot
/// (it exists a predecessor p of s in st_blue and s != t and
/// the arc between p and s is accepting)) then
/// report cycle;
/// else if the edge (s,t) is accepting then
/// end if;
/// if the edge (s,t) is accepting then
/// call dfs_red(t);
/// end if;
/// end for;

21
src/tgbaalgos/tau03opt.hh
View file

@ -59,15 +59,14 @@ namespace spot
/// for all b in a do
/// weight[b] = weight[b] - 1;
/// end for;
/// else
/// Acc = s.acc U a;
/// if t.color == cyan &&
/// (Acc U support(weight -t.weight) U t.acc) == all_acc then
/// report a cycle;
/// else if Acc not included in t.acc then
/// t.acc := t.acc U Acc
/// call dfs_red(t, Acc);
/// end if;
/// end if;
/// Acc = s.acc U a;
/// if t.color == cyan &&
/// (Acc U support(weight - t.weight) U t.acc) == all_acc then
/// report a cycle;
/// else if Acc not included in t.acc then
/// t.acc := t.acc U Acc;
/// call dfs_red(t, Acc);
/// end if;
/// end for;
/// s.color = blue;
@ -78,10 +77,10 @@ namespace spot
/// for all t in post(s) do
/// let (s, l, a, t) be the edge from s to t;
/// if t.color == cyan &&
/// (Acc U support(weight -t.weight) U t.acc) == all_acc then
/// (Acc U support(weight - t.weight) U t.acc) == all_acc then
/// report a cycle;
/// else if t.color != white and Acc not included in t.acc then
/// t.acc := t.acc U Acc
/// t.acc := t.acc U Acc;
/// call dfs_red(t, Acc);
/// end if;
/// end for;