depgraph

func (*Graph) DependOn ¶

func (g *Graph) DependOn(child, parent string) error

func (*Graph) Dependencies ¶

func (g *Graph) Dependencies(child string) nodeset

func (*Graph) Dependents ¶

func (g *Graph) Dependents(parent string) nodeset

func (*Graph) DependsOn ¶

func (g *Graph) DependsOn(child, parent string) bool

func (*Graph) HasDependent ¶

func (g *Graph) HasDependent(parent, child string) bool

func (*Graph) Leaves ¶

func (g *Graph) Leaves() []string

func (*Graph) TopoSorted ¶

func (g *Graph) TopoSorted() []string

TopoSorted returns all the nodes in the graph is topological sort order. See also `Graph.TopoSortedLayers()`.

func (*Graph) TopoSortedLayers ¶

func (g *Graph) TopoSortedLayers() [][]string

TopoSortedLayers returns a slice of all of the graph nodes in topological sort order. That is, if `B` depends on `A`, then `A` is guaranteed to come before `B` in the sorted output. The graph is guaranteed to be cycle-free because cycles are detected while building the graph. Additionally, the output is grouped into "layers", which are guaranteed to not have any dependencies within each layer. This is useful, e.g. when building an execution plan for some DAG, in which case each element within each layer could be executed in parallel. If you do not need this layered property, use `Graph.TopoSorted()`, which flattens all elements.