Skip to content
Snippets Groups Projects
Commit b4dbdf30 authored by erwan's avatar erwan
Browse files

test: more fix

parent 89e11dff
No related branches found
No related tags found
No related merge requests found
Pipeline #215130 passed with warnings
Stage: build
    Stage: release
      Stage: deploy
        Hide whitespace changes
        Inline Side-by-side
        test/dijkstra-ring/state.ml
        + 1
        − 1
        View file @ b4dbdf30
        ......@@ -2,7 +2,7 @@
        (* semi-anonymous network: each node knows if its neighbors is the root!
        Actually only necessary to define the legitimate predicate
        *)
        let k = card()
        let k = Algo.card()
        type t = { root: bool ; v : int }
        let to_string s = Printf.sprintf "c=%i" s.v
        let first = ref true
        ......
        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