dag

Documentation

Index

• type Graph
  • func New() *Graph
  • func (g *Graph) Ancestors(path string) (ancestors []string)
  • func (g *Graph) Children(from string) (tos []string)
  • func (g *Graph) Descendants(path string) (descendants []string)
  • func (g *Graph) Link(from, to string)
  • func (g *Graph) Nodes() (nodes []string)
  • func (g *Graph) Parents(to string) (froms []string)
  • func (g *Graph) Remove(paths ...string)
  • func (g *Graph) Set(path string)
  • func (g *Graph) ShortestPath(start, end string) (nodes []string, err error)
  • func (g *Graph) ShortestPathOf(start string, ends []string) (nodes []string, err error)
  • func (g *Graph) String() string

Types

type Graph

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

func New

func New() *Graph

func (*Graph) Ancestors

func (g *Graph) Ancestors(path string) (ancestors []string)

Ancestors recursively returns parents, parents of parents, etc.

func (*Graph) Children

func (g *Graph) Children(from string) (tos []string)

Return the links out (dependencies)

func (*Graph) Descendants

func (g *Graph) Descendants(path string) (descendants []string)

Descendants recursively returns children, children of children, etc. Descendants includes self.

func (*Graph) Link

func (g *Graph) Link(from, to string)

func (*Graph) Nodes

func (g *Graph) Nodes() (nodes []string)

func (*Graph) Parents

func (g *Graph) Parents(to string) (froms []string)

Return the links in (parents)

func (*Graph) Remove

func (g *Graph) Remove(paths ...string)

Remove a node

func (*Graph) Set

func (g *Graph) Set(path string)

func (*Graph) ShortestPath

func (g *Graph) ShortestPath(start, end string) (nodes []string, err error)

func (*Graph) ShortestPathOf

func (g *Graph) ShortestPathOf(start string, ends []string) (nodes []string, err error)

func (*Graph) String

func (g *Graph) String() string

String returns a digraph