From 1072b2dd993a697493516753567dd149cd858110 Mon Sep 17 00:00:00 2001 From: Alexandre Duret-Lutz Date: Mon, 24 Jan 2005 18:57:08 +0000 Subject: [PATCH] * src/tgbaalgos/tau03opt.hh, src/tgbaalgos/se05.hh: Correct pseudo-code. From Denis. --- ChangeLog | 3 +++ src/tgbaalgos/se05.hh | 5 +++-- src/tgbaalgos/tau03opt.hh | 21 ++++++++++----------- 3 files changed, 16 insertions(+), 13 deletions(-) diff --git a/ChangeLog b/ChangeLog index 9ddc68a96..356585560 100644 --- a/ChangeLog +++ b/ChangeLog @@ -1,5 +1,8 @@ 2005-01-24 Alexandre Duret-Lutz + * 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. diff --git a/src/tgbaalgos/se05.hh b/src/tgbaalgos/se05.hh index 18e47524a..6ff2dd1cd 100644 --- a/src/tgbaalgos/se05.hh +++ b/src/tgbaalgos/se05.hh @@ -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; diff --git a/src/tgbaalgos/tau03opt.hh b/src/tgbaalgos/tau03opt.hh index 79783b5cf..bd942bd59 100644 --- a/src/tgbaalgos/tau03opt.hh +++ b/src/tgbaalgos/tau03opt.hh @@ -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;