Method checkCircularDependencies

sdk/go/validator/validator.go:249–308

checkCircularDependencies detects cycles in the dependency graph nolint:gocognit // TODO: refactor to reduce complexity

(tasks []*model.Task, taskMap map[string]*model.Task, result *ValidationResult)

//
//nolint:gocognit // TODO: refactor to reduce complexity
func (v *Validator) checkCircularDependencies(tasks []*model.Task, taskMap map[string]*model.Task, result *ValidationResult) {
	// Build adjacency list
	graph := make(map[string][]string)
	for _, task := range tasks {
		graph[task.ID] = task.Dependencies
	}

	// Track visit states: 0 = unvisited, 1 = visiting, 2 = visited
	visitState := make(map[string]int)
	path := []string{}

	var hasCycle func(string) bool
	hasCycle = func(taskID string) bool {
		if visitState[taskID] == 1 {
			// Found a cycle - build cycle path
			cycleStart := -1
			for i, id := range path {
				if id == taskID {
					cycleStart = i
					break
				}
			}
			if cycleStart >= 0 {
				cyclePath := append(path[cycleStart:], taskID)
				result.AddIssue(LevelError, taskID, taskMap[taskID].FilePath,
					fmt.Sprintf("circular dependency detected: %s", strings.Join(cyclePath, " -> ")))
			}
			return true
		}

		if visitState[taskID] == 2 {
			return false // Already fully processed
		}

		visitState[taskID] = 1
		path = append(path, taskID)

		for _, depID := range graph[taskID] {
			if _, exists := taskMap[depID]; !exists {
				continue // Skip missing dependencies (already reported)
			}
			if hasCycle(depID) {
				visitState[taskID] = 2
				path = path[:len(path)-1]
				return true
			}
		}

		visitState[taskID] = 2
		path = path[:len(path)-1]
		return false
	}

	// Check each task for cycles
	for taskID := range taskMap {
		if visitState[taskID] == 0 {
			hasCycle(taskID)
		}