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 11:31:17 +00:00
2026-05-06 09:19:56 +00:00
2026-05-07 19:33:09 +00:00
2026-05-05 12:35:26 +00:00
2026-05-06 09:19:56 +00:00
2026-05-06 09:19:56 +00:00
2026-05-06 09:19:56 +00:00
2026-04-25 08:06:17 +00:00
2026-04-24 16:03:00 +00:00
2026-05-06 09:19:56 +00:00
2026-05-06 17:40:53 +00:00
2026-05-06 17:02:02 +00:00
2026-04-25 08:54:05 +00:00
2026-05-06 09:19:56 +00:00
2026-05-06 15:17:43 +00:00
2026-04-26 17:54:34 +00:00
2026-04-25 18:35:32 +00:00
2026-05-06 09:19:56 +00:00
2026-05-07 19:45:23 +00:00
2026-04-24 16:03:00 +00:00
2026-05-06 09:19:56 +00:00
2026-05-10 04:20:47 +00:00
2026-05-06 09:19:56 +00:00
2026-04-24 15:16:45 +00:00
2026-04-23 19:42:16 +00:00
2026-05-01 20:20:56 +00:00
2026-04-25 16:32:26 +00:00
2026-05-07 02:38:57 +00:00
2026-05-06 11:06:05 +00:00
2026-05-07 18:29:20 +00:00