datalog: shortest-path demo on weighted DAG (176/176)
Some checks failed
Test, Build, and Deploy / test-build-deploy (push) Failing after 37s

dl-demo-shortest-path-rules: path enumerates X→Z with cost
W = sum of edge weights via is/+; shortest filters to the
minimum cost path per (X, Y) pair via min aggregation.

3 demo tests cover direct/multi-hop choice, multi-hop wins on
cheaper route, and unreachable-empty.

Note: cycles produce infinite distance values without a depth
filter; the rule docstring flags this and suggests adding
(<, D, MAX) for graphs that may cycle.
This commit is contained in:
2026-05-08 09:35:38 +00:00
parent 380580af17
commit cf634ad2b1
5 changed files with 62 additions and 6 deletions

View File

@@ -1,6 +1,6 @@
# datalog scoreboard
**173 / 173 passing** (0 failure(s)).
**176 / 176 passing** (0 failure(s)).
| Suite | Passed | Total | Status |
|-------|--------|-------|--------|
@@ -13,4 +13,4 @@
| negation | 10 | 10 | ok |
| aggregates | 16 | 16 | ok |
| api | 11 | 11 | ok |
| demo | 15 | 15 | ok |
| demo | 18 | 18 | ok |