Function buildNode

desktop/src/features/agent-memory/lib/buildMemoryGraph.ts:82–97

(entry: EngramEntry)

  }

  function buildNode(entry: EngramEntry): MemoryTreeNode {
    visited.add(entry.slug);
    const children: MemoryTreeNode[] = [];
    for (const refSlug of entry.outgoingRefs) {
      const target = bySlug.get(refSlug);
      if (!target) {
        recordDangling(refSlug, entry.slug);
        continue;
      }
      // Skip self-refs and already-visited nodes; the visited guard makes
      // the recursion finite even on cyclic graphs.
      if (visited.has(target.slug)) continue;
      children.push(buildNode(target));
    }
    return { entry, children };
  }

  const rootedTree = listing.core ? buildNode(listing.core) : null;