Function dfs

packages/cli/src/utils/analysis.ts:341–363

(nodeId: string, path: string[])

  const cycleBlocks = new Set<string>()

  function dfs(nodeId: string, path: string[]): void {
    visited.add(nodeId)
    recursionStack.add(nodeId)

    const neighbors = graph.get(nodeId) ?? new Set()
    for (const neighbor of neighbors) {
      if (!visited.has(neighbor)) {
        dfs(neighbor, [...path, nodeId])
      } else if (recursionStack.has(neighbor)) {
        // Found a cycle - mark all nodes in the cycle
        const cycleStart = path.indexOf(neighbor)
        if (cycleStart !== -1) {
          for (let i = cycleStart; i < path.length; i++) {
            cycleBlocks.add(path[i])
          }
        }
        cycleBlocks.add(neighbor)
        cycleBlocks.add(nodeId)
      }
    }

    recursionStack.delete(nodeId)
  }

  for (const node of dag.nodes) {
    if (!visited.has(node.id)) {