Function traverseNeighbors

src/core/memory-graph.ts:220–249

(
  graph: GraphStore, nodeId: string, queryVec: number[], depth: number, maxDepth: number,
  pathLabels: string[], visited: Set<string>, results: TraversalResult[], edgeFilter?: RelationType[],
)

}

function traverseNeighbors(
  graph: GraphStore, nodeId: string, queryVec: number[], depth: number, maxDepth: number,
  pathLabels: string[], visited: Set<string>, results: TraversalResult[], edgeFilter?: RelationType[],
): void {
  if (depth > maxDepth) return;

  for (const edge of getEdgesForNode(graph, nodeId)) {
    if (edgeFilter && !edgeFilter.includes(edge.relation)) continue;
    const neighborId = getNeighborId(edge, nodeId);
    if (visited.has(neighborId)) continue;

    const neighbor = graph.nodes[neighborId];
    if (!neighbor) continue;

    visited.add(neighborId);
    const similarity = cosine(queryVec, neighbor.embedding);
    const edgeDecay = decayWeight(edge);
    const relevance = similarity * 0.6 + (edgeDecay / Math.max(edge.weight, 0.01)) * 0.4;

    results.push({
      node: neighbor,
      depth,
      pathRelations: [...pathLabels, `--[${edge.relation}]-->`, neighbor.label],
      relevanceScore: Math.round(relevance * 1000) / 10,
    });

    neighbor.lastAccessed = Date.now();
    traverseNeighbors(graph, neighborId, queryVec, depth + 1, maxDepth, [...pathLabels, `--[${edge.relation}]-->`, neighbor.label], visited, results, edgeFilter);
  }
}

export async function pruneStaleLinks(rootDir: string, threshold?: number): Promise<{ removed: number; remaining: number }> {
  const graph = await loadGraph(rootDir);