Answer prose round 1 and product-owner round 1: plainer walk, link and ancestor comments, a complexity rule that reads one way, shorter items 115 and 116, and a cycle through a cell filed under item 115

graph.go

@@ -8,10 +8,10 @@ import (
 	"github.com/larvit/fejkdata/internal/invariant"
 )
 
-// eachNode visits n and every node contained within it once, passing the label naming
-// each in an error: the dot path reaching it, and a table cell's line after it. It never
-// crosses a reference edge — a {/path} reference is skipped — so a single inline node is
-// walked on its own.
+// eachNode visits n and every node inside it once, passing fn the label an error names each
+// by: the dot path reaching it, then ", line N" for a table cell. It never crosses a
+// reference edge — a {/path} reference is skipped — so a single inline node is walked on
+// its own.
 func eachNode(n node, label string, fn func(label string, n node) error) error {
 	seen := map[node]bool{}
 	var visit func(string, node) error