Function searchGraph

src/core/memory-graph.ts:183–218

(rootDir: string, query: string, maxDepth: number = 1, topK: number = 5, edgeFilter?: RelationType[])

}

export async function searchGraph(rootDir: string, query: string, maxDepth: number = 1, topK: number = 5, edgeFilter?: RelationType[]): Promise<GraphSearchResult> {
  const graph = await loadGraph(rootDir);
  const nodes = Object.values(graph.nodes);
  if (nodes.length === 0) return { direct: [], neighbors: [], totalNodes: 0, totalEdges: 0 };

  const [queryVec] = await fetchEmbedding(query);
  const scored = nodes.map(n => ({ node: n, score: cosine(queryVec, n.embedding) }))
    .sort((a, b) => b.score - a.score);

  const directHits = scored.slice(0, topK).map(({ node, score }) => {
    node.lastAccessed = Date.now();
    return {
      node,
      depth: 0,
      pathRelations: [] as string[],
      relevanceScore: Math.round(score * 1000) / 10,
    };
  });

  const neighborResults: TraversalResult[] = [];
  const visited = new Set(directHits.map(h => h.node.id));

  for (const hit of directHits) {
    traverseNeighbors(graph, hit.node.id, queryVec, 1, maxDepth, [hit.node.label], visited, neighborResults, edgeFilter);
  }

  neighborResults.sort((a, b) => b.relevanceScore - a.relevanceScore);

  scheduleSave(rootDir);
  return {
    direct: directHits,
    neighbors: neighborResults.slice(0, topK * 2),
    totalNodes: nodes.length,
    totalEdges: Object.keys(graph.edges).length,
  };
}

function traverseNeighbors(
  graph: GraphStore, nodeId: string, queryVec: number[], depth: number, maxDepth: number,