Function buildAnalyzeResult

packages/cli/src/commands/analyze.ts:86–161

(path: string, analysis: AnalysisResult, blockMap: Map<string, BlockInfo>)

}

function buildAnalyzeResult(path: string, analysis: AnalysisResult, blockMap: Map<string, BlockInfo>): AnalyzeResult {
  const { stats, lint, dag } = analysis

  // Helper to get block label
  const getLabel = (blockId: string): string => {
    const info = blockMap.get(blockId)
    if (info) {
      return `${info.notebookName}/${info.label}`
    }
    return blockId.slice(0, 8)
  }

  // Find entry points (blocks with no incoming edges)
  const blocksWithIncoming = new Set(dag.edges.map(e => e.to))
  const entryPoints = dag.nodes
    .filter(n => !blocksWithIncoming.has(n.id))
    .map(n => ({
      id: n.id,
      label: getLabel(n.id),
    }))

  // Find exit points (blocks with no outgoing edges)
  const blocksWithOutgoing = new Set(dag.edges.map(e => e.from))
  const exitPoints = dag.nodes
    .filter(n => !blocksWithOutgoing.has(n.id))
    .map(n => ({
      id: n.id,
      label: getLabel(n.id),
    }))

  // Calculate longest dependency chain using BFS
  const longestChain = calculateLongestChain(dag.nodes, dag.edges)

  // Calculate quality score (0-100)
  // Start at 100, subtract for issues
  let score = 100
  score -= lint.issueCount.errors * 10 // -10 per error
  score -= lint.issueCount.warnings * 2 // -2 per warning
  score = Math.max(0, Math.min(100, score)) // Clamp to 0-100

  // Generate suggestions
  const suggestions = generateSuggestions(analysis)

  return {
    path,
    project: {
      name: stats.projectName,
      id: stats.projectId,
      notebooks: stats.notebookCount,
      blocks: stats.totalBlocks,
      linesOfCode: stats.totalLinesOfCode,
    },
    quality: {
      score,
      errors: lint.issueCount.errors,
      warnings: lint.issueCount.warnings,
      issues: lint.issues.map(issue => ({
        severity: issue.severity,