testing and documentation

echo-memory.plugin.src/skills/echo-memory/scripts/echo_recall.py

@@ -247,27 +247,34 @@ def expand_graph(seeds, nmap: dict, base_scores: dict, max_hops: int = MAX_HOPS)
     score_of = dict(base_scores)
     seen = set(seeds)
     results: dict[str, tuple[float, str]] = {}
-    dq = deque((s, 0) for s in seeds)
-    while dq:
-        path, hop = dq.popleft()
-        if hop >= max_hops:
-            continue
-        text = links.get_text(path)
-        if text is None:
-            continue
-        body = strip_frontmatter(text)
-        targets = set(links.all_wikilinks(body)) | set(links.source_notes(text))
-        parent = score_of.get(path, 1.0)
-        for t in targets:
-            tp = _resolve_target(t, nmap)
-            if not tp or tp in seeds:
+    # Breadth-first by HOP so each frontier's note bodies can be fetched concurrently
+    # (echo.read_many) instead of one blocking GET per node. Scoring is unchanged: a
+    # neighbour keeps the max decayed score over the paths that reach it, and non-seed
+    # parents score 1.0 exactly as the serial deque version did.
+    frontier = list(seeds)
+    for hop in range(max_hops):
+        if not frontier:
+            break
+        texts = echo.read_many(frontier)
+        next_frontier: list[str] = []
+        for path in frontier:
+            text = texts.get(path)
+            if text is None:
                 continue
+            body = strip_frontmatter(text)
+            targets = set(links.all_wikilinks(body)) | set(links.source_notes(text))
+            parent = score_of.get(path, 1.0)
             decayed = parent * (GRAPH_DECAY ** (hop + 1))
-            if decayed > results.get(tp, (0.0, ""))[0]:
-                results[tp] = (decayed, path)
-            if tp not in seen:
-                seen.add(tp)
-                dq.append((tp, hop + 1))
+            for t in targets:
+                tp = _resolve_target(t, nmap)
+                if not tp or tp in seeds:
+                    continue
+                if decayed > results.get(tp, (0.0, ""))[0]:
+                    results[tp] = (decayed, path)
+                if tp not in seen:
+                    seen.add(tp)
+                    next_frontier.append(tp)
+        frontier = next_frontier
     return sorted(results.items(), key=lambda kv: -kv[1][0])