dag

Documentation

Index

• type DAG
  • func NewDAG(nodes map[string][]string) *DAG
  • func (d *DAG) Ancestors(id string, from []string) []string
  • func (d *DAG) Descendants(id string, to []string) []string
  • func (d *DAG) Ghosts() []string
  • func (d *DAG) Leaves() []string
  • func (d *DAG) NewNode(id string, parents []string)
  • func (d *DAG) Sorted() []string

Types

type DAG

type DAG struct {
	// contains filtered or unexported fields
}

DAG represents a directected acyclic graph

func NewDAG

func NewDAG(nodes map[string][]string) *DAG

func (*DAG) Ancestors

func (d *DAG) Ancestors(id string, from []string) []string

func (*DAG) Descendants

func (d *DAG) Descendants(id string, to []string) []string

func (*DAG) Ghosts

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

Ghosts returns nodes that were referenced as parents but never created.

func (*DAG) Leaves

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

func (*DAG) NewNode

func (d *DAG) NewNode(id string, parents []string)

func (*DAG) Sorted

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

Sorted returns all nodes in a topologically sorted order