MAJ terminée. Nous sommes passés en version 14.6.2 . Pour consulter les "releases notes" associées c'est ici :

https://about.gitlab.com/releases/2022/01/11/security-release-gitlab-14-6-2-released/
https://about.gitlab.com/releases/2022/01/04/gitlab-14-6-1-released/

Commit a97a63ae authored by POTTIER Francois's avatar POTTIER Francois
Browse files

Plugged in A* instead of Dijkstra for backward search.

This leads to slightly fewer questions in the main analysis (-10% on c.mly)
and many fewer nodes considered during backward search (4K instead of 60K on
c.mly), yet it is slightly slower (+10% on c.mly).
parent 5eb576e7
......@@ -389,7 +389,7 @@ let backward (s', z) : P.property =
let module G = struct
(* A vertex is a pair [s, z]. *)
type vertex =
type node =
Lr1.node * Terminal.t
let equal (s'1, z1) (s'2, z2) =
......@@ -440,8 +440,11 @@ let backward (s', z) : P.property =
)
) (Lr1.predecessors s')
let estimate (s', _z) =
approx s'
end in
let module D = Dijkstra.Make(G) in
let module A = Astar.Make(G) in
let module S = struct exception Success of P.property end in
(* Search backwards from [s', z], stopping as soon as an entry state
......@@ -449,7 +452,7 @@ let backward (s', z) : P.property =
that have been found. *)
try
let _ = D.search (fun (_, (s, _), ps) ->
let _ = A.search (fun ((s, _), ps) ->
(* Debugging. TEMPORARY *)
incr es;
if !es mod 10000 = 0 then
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment