giles
5384ff6c42
Some checks failed
Test, Build, and Deploy / test-build-deploy (push) Failing after 22s
DFS topological sort — recurse on out-edges first, prepend after:
let rec dfs v =
if not visited.(v) then begin
visited.(v) <- true;
List.iter dfs adj.(v);
order := v :: !order
end
Same 6-node DAG as iter 230's Kahn's-algorithm baseline:
0 -> {1, 2}
1 -> {3}
2 -> {3, 4}
3 -> {5}
4 -> {5}
5
DFS order: [0; 2; 4; 1; 3; 5]
Horner fold: 0->0->2->24->241->2413->24135.
Complementary to topo_sort.ml (Kahn's BFS); tests recursive DFS
with no explicit stack + List.fold_left as a horner reduction.
160 baseline programs total.
27 lines
350 B
OCaml
27 lines
350 B
OCaml
let n = 6
|
|
let adj = [|
|
|
[1; 2];
|
|
[3];
|
|
[3; 4];
|
|
[5];
|
|
[5];
|
|
[]
|
|
|]
|
|
|
|
let visited = Array.make n false
|
|
let order = ref []
|
|
|
|
let rec dfs v =
|
|
if not visited.(v) then begin
|
|
visited.(v) <- true;
|
|
List.iter dfs adj.(v);
|
|
order := v :: !order
|
|
end
|
|
|
|
;;
|
|
|
|
for v = 0 to n - 1 do
|
|
dfs v
|
|
done;
|
|
List.fold_left (fun acc v -> acc * 10 + v) 0 !order
|