From 1460df0e0eea2bdd43b26919176d893354e86099 Mon Sep 17 00:00:00 2001
From: Erwan Jahier <erwan.jahier@univ-grenoble-alpes.fr>
Date: Fri, 7 Feb 2020 11:39:48 +0100
Subject: [PATCH] CI: add a missing file
---
test/bfs-st-HC92/ring.dot | 13 +++++++++++++
test/st-KK06-algo2/p.ml | 4 ++--
2 files changed, 15 insertions(+), 2 deletions(-)
create mode 100644 test/bfs-st-HC92/ring.dot
diff --git a/test/bfs-st-HC92/ring.dot b/test/bfs-st-HC92/ring.dot
new file mode 100644
index 00000000..dbb0da3d
--- /dev/null
+++ b/test/bfs-st-HC92/ring.dot
@@ -0,0 +1,13 @@
+graph ring7 {
+
+ p1 [algo="p.ml"]
+ p2 [algo="p.ml" ]
+ p3 [algo="p.ml"]
+ p4 [algo="p.ml"]
+ p5 [algo="p.ml"]
+ p6 [algo="p.ml"]
+ p7 [algo="p.ml"]
+
+ p1 -- p2 -- p3 -- p4 -- p5 -- p6 -- p7 -- p1
+
+}
diff --git a/test/st-KK06-algo2/p.ml b/test/st-KK06-algo2/p.ml
index 317849ad..d708da33 100644
--- a/test/st-KK06-algo2/p.ml
+++ b/test/st-KK06-algo2/p.ml
@@ -1,4 +1,4 @@
-(* Time-stamp: <modified the 07/02/2020 (at 10:44) by Erwan Jahier> *)
+(* Time-stamp: <modified the 07/02/2020 (at 11:36) by Erwan Jahier> *)
(*
A Self-stabilizing Algorithm for Finding a Spanning Tree in a Polynomial Number of Moves
@@ -19,7 +19,7 @@ let n = Algo.card ()
let bigN = 2*n
let (init_state: int -> 'st) =
- fun _nl -> (Random.int 1073741823)
+ fun _nl -> (Random.int bigN)
let min_n nl = (* returns the min of the neigbhors *)
--
GitLab