giles
42a506faff
Test, Build, and Deploy / test-build-deploy (push) Failing after 23s
ocaml: phase 5.1 dijkstra.ml baseline (5-node SSSP, dist(0,4) = 7)
Array-based O(n^2) Dijkstra on a small directed weighted graph:
edges = [|
[(1, 4); (2, 1)]; (* 0 -> 1 (w=4), 2 (w=1) *)
[(3, 1)]; (* 1 -> 3 (w=1) *)
[(1, 2); (3, 5)]; (* 2 -> 1 (w=2), 3 (w=5) *)
[(4, 3)]; (* 3 -> 4 (w=3) *)
[] (* 4 sink *)
|]
Optimal path 0->2->1->3->4 has weight 1+2+1+3 = 7.
Tests: array-of-list-of-int-pair literal, List.iter with tuple
destructuring closure, in-place dist mutation, nested for + ref.
141 baseline programs total.
2026-05-10 04:20:47 +00:00
..
2026-05-07 19:33:09 +00:00
2026-05-06 23:00:12 +00:00
2026-05-06 22:01:51 +00:00
2026-05-01 23:30:48 +00:00
2026-05-07 19:45:10 +00:00
2026-05-06 22:46:48 +00:00
2026-05-07 01:20:32 +00:00
2026-05-01 22:33:27 +00:00
2026-05-07 17:17:17 +00:00
2026-05-10 04:20:47 +00:00
2026-05-07 17:35:49 +00:00
2026-05-01 23:18:04 +00:00
2026-05-06 22:01:51 +00:00
2026-05-07 18:29:26 +00:00
2026-04-02 12:50:35 +00:00
2026-04-03 21:48:54 +00:00
2026-04-03 21:48:54 +00:00
2026-05-07 02:38:47 +00:00
2026-04-03 21:48:54 +00:00
2026-05-06 16:58:18 +00:00
2026-04-04 20:49:02 +00:00
2026-04-22 09:08:00 +00:00
2026-04-22 09:08:00 +00:00
2026-04-04 20:49:02 +00:00
2026-04-11 08:03:45 +00:00
2026-05-01 21:00:22 +00:00
2026-04-03 21:48:54 +00:00
2026-04-11 08:19:16 +00:00
2026-04-03 21:48:54 +00:00
2026-04-04 20:49:02 +00:00
2026-04-12 18:31:34 +00:00
2026-04-04 20:49:02 +00:00
2026-04-04 20:49:02 +00:00
2026-04-08 10:12:57 +00:00