class

Barista::Graph

Inherits Reference < Object

A simple Directed Acyclic Graph

Constructors

new(nodes : Array(String) = [] of String, vertices : Hash(String, Barista::Graph::Vertex) = {} of String => Vertex)

add(node : String)

Adds a task name to the Graph

add(node : Symbol)

add_edge(from : String, to : String) : Nil

Connects 2 tasks in the Graph with an edge

add_edge(from : Symbol, to : Symbol)

filter(names, result = names.dup)

Fetch a flat list of dependencies given an array of task names

nodes

vertices