Function expandRankedViaGraph

src/context/retrieval.ts:348–375

(cwd: string, ranked: RankedFile[], maxFiles: number)

 * embeddings). We seed it with the top 3 semantic hits and expand 1 hop.
 */
export async function expandRankedViaGraph(cwd: string, ranked: RankedFile[], maxFiles: number): Promise<RankedFile[]> {
  const { buildImportGraph, expandViaGraph } = await import('./import-graph.js');
  // Walk project source for the graph (cap to keep it fast).
  const files = await walkSource(cwd, 2000);
  const graph = await buildImportGraph(
    cwd,
    files.map(f => ({ rel: f.rel, content: f.content })),
  );

  const seeds = ranked.slice(0, 3).map(r => r.file);
  const neighbors = expandViaGraph(graph, seeds, { hops: 1, maxFiles: maxFiles + 6, hubDamping: true });

  const seen = new Set(ranked.map(r => r.file));
  const out: RankedFile[] = [...ranked];
  const lowestSemantic = ranked.length ? ranked[ranked.length - 1]!.score : 0.3;
  for (const n of neighbors) {
    if (n.distance === 0 || seen.has(n.file)) continue; // already a semantic hit
    seen.add(n.file);
    // Discounted score: below the lowest semantic hit, scaled by the graph
    // weight (which already accounts for distance, direction, and hub damping).
    out.push({
      file: n.file,
      score: Math.max(0.04, lowestSemantic * 0.5 * n.weight),
      bestLines: 'import-neighbor',
    });
  }
  return out.sort((a, b) => b.score - a.score).slice(0, maxFiles);
}

/** Render the ranked files as a system-prompt context block (empty string if none). */
export function formatRetrievalBlock(files: RankedFile[]): string {