ocaml: phase 5.1 bfs.ml baseline (20/20 pass)

Graph BFS using Queue + Hashtbl visited-set + List.assoc_opt + List.iter. Returns 6 for a graph where A reaches B/C/D/E/F. Demonstrates 4 stdlib modules (Queue, Hashtbl, List) cooperating in a real algorithm.
2026-05-08 21:05:32 +00:00
parent a4ef9a8ec9
commit 6d9ac1e55a
3 changed files with 48 additions and 0 deletions
--- a/lib/ocaml/baseline/expected.json
+++ b/lib/ocaml/baseline/expected.json
@@ -1,5 +1,6 @@
 {
  "anagrams.ml": 3,
+  "bfs.ml": 6,
  "btree.ml": 39,
  "calc.ml": 13,
  "closures.ml": 315,