Function NewGraph

sdk/go/graph/graph.go:65–90

NewGraph creates a new graph from a list of tasks

(tasks []*model.Task)

// NewGraph creates a new graph from a list of tasks
func NewGraph(tasks []*model.Task) *Graph {
	g := &Graph{
		Tasks:        tasks,
		TaskMap:      make(map[string]*model.Task),
		Adjacency:    make(map[string][]string),
		RevAdjacency: make(map[string][]string),
	}

	// Build task map
	for _, task := range tasks {
		g.TaskMap[task.ID] = task
	}

	// Build adjacency lists
	for _, task := range tasks {
		for _, depID := range task.Dependencies {
			// task depends on depID
			// so depID -> task in forward adjacency (depID blocks task)
			g.Adjacency[depID] = append(g.Adjacency[depID], task.ID)
			// task -> depID in reverse adjacency
			g.RevAdjacency[task.ID] = append(g.RevAdjacency[task.ID], depID)
		}
	}

	return g
}

// GetDownstream returns all tasks that depend on the given task (transitively)
func (g *Graph) GetDownstream(taskID string) map[string]bool {