dag

Documentation

Index

• type DAG
  • func NewDAG() *DAG
  • func (d *DAG) Add(name string, dependants []string) (*Node, error)
  • func (d *DAG) Delete(name string)
  • func (d *DAG) GetChildren(name string) []string
  • func (d *DAG) GetDeepChildren(name string) []string
  • func (d *DAG) GetParents(name string) []string
  • func (d *DAG) Has(name string) bool
  • func (d *DAG) TopologicalSort() []string
• type Node

Types

type DAG

type DAG struct {
	NameMap map[string]*Node
}

DAG is a simple implementation of a directed acyclic graph.

func NewDAG

func NewDAG() *DAG

func (*DAG) Add

func (d *DAG) Add(name string, dependants []string) (*Node, error)

func (*DAG) Delete

func (d *DAG) Delete(name string)

func (*DAG) GetChildren

func (d *DAG) GetChildren(name string) []string

GetChildren only returns the immediate children

func (*DAG) GetDeepChildren

func (d *DAG) GetDeepChildren(name string) []string

GetDeepChildren will go down the DAG and get all children in the subtree

func (*DAG) GetParents

func (d *DAG) GetParents(name string) []string

GetParents only returns the immediate parents

func (*DAG) Has

func (d *DAG) Has(name string) bool

func (*DAG) TopologicalSort

func (d *DAG) TopologicalSort() []string

type Node

type Node struct {
	Name     string
	Present  bool
	Parents  map[string]*Node
	Children map[string]*Node
}