Method DetectCycles

sdk/go/graph/graph.go:131–177

DetectCycles finds all cycles in the graph nolint:gocognit // TODO: refactor to reduce complexity

()

//
//nolint:gocognit // TODO: refactor to reduce complexity
func (g *Graph) DetectCycles() [][]string {
	var cycles [][]string
	visited := make(map[string]bool)
	recStack := make(map[string]bool)
	path := []string{}

	var dfs func(taskID string) bool
	dfs = func(taskID string) bool {
		visited[taskID] = true
		recStack[taskID] = true
		path = append(path, taskID)

		for _, depID := range g.RevAdjacency[taskID] {
			if !visited[depID] {
				if dfs(depID) {
					return true
				}
			} else if recStack[depID] {
				// Found a cycle
				cycleStart := -1
				for i, id := range path {
					if id == depID {
						cycleStart = i
						break
					}
				}
				if cycleStart != -1 {
					cycle := make([]string, len(path)-cycleStart)
					copy(cycle, path[cycleStart:])
					cycles = append(cycles, cycle)
				}
			}
		}

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

	for _, task := range g.Tasks {
		if !visited[task.ID] {
			dfs(task.ID)
		}
	}

	return cycles
}

// FilterTasks creates a subgraph with only the specified task IDs
func (g *Graph) FilterTasks(taskIDs map[string]bool) *Graph {