From dd3af3fe27736c4c20deabe86030a90facb228ff Mon Sep 17 00:00:00 2001
From: Rob Simmons <robsimmons@gmail.com>
Date: Sun, 21 Jul 2024 12:03:12 -0400
Subject: [PATCH] Modify example

---
 src/web/examples.ts | 12 +++++++-----
 1 file changed, 7 insertions(+), 5 deletions(-)

diff --git a/src/web/examples.ts b/src/web/examples.ts
index 9b464f9..ea780de 100644
--- a/src/web/examples.ts
+++ b/src/web/examples.ts
@@ -157,13 +157,15 @@ export const GRAPH_GENERATION_EXAMPLE = `
 vertex 6.
 vertex (minus N 1) :- vertex N, N > 0.
 
+# For each potential edge, we mark it present or absent
+# The relation is symmetric: edge X Y == edge Y X
 edge X Y is { extant, absent } :- vertex X, vertex Y, X != Y.
 edge X Y is Z :- edge Y X is Z.
 
-reachable N N :- vertex N.
-reachable Start Y :- reachable Start X, edge X Y is extant.
+path N N :- vertex N.
+path X Z :- path X Y, edge Y Z is extant.
 
-#demand reachable 0 1.
-#demand reachable 5 6.
-#forbid reachable 0 6.
+#demand path 0 1.
+#demand path 5 6.
+#forbid path 0 6.
 `.trim();