graph

Documentation

Index

• type Graph
  • func New() *Graph
  • func (g *Graph) Cliques() (cliques [][]Node)
  • func (g *Graph) Clone() *Graph
  • func (g *Graph) Edge(parent Node, child Node)
  • func (g *Graph) Node(node Node)
  • func (g *Graph) Toposort() (sorted []Node, hasCycles bool)
  • func (g *Graph) ToposortBy(node Node) (sorted []string)
• type Node

Types

type Graph

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

Graph struct

func New

func New() *Graph

New function

func (*Graph) Cliques

func (g *Graph) Cliques() (cliques [][]Node)

Cliques gets the circular subgraphs We're going to group these together in a single package, so Go doesn't barf.

func (*Graph) Clone

func (g *Graph) Clone() *Graph

Clone the graph

func (*Graph) Edge

func (g *Graph) Edge(parent Node, child Node)

Edge adds an edge

func (*Graph) Node

func (g *Graph) Node(node Node)

func (*Graph) Toposort

func (g *Graph) Toposort() (sorted []Node, hasCycles bool)

Toposort sorts topologically

func (*Graph) ToposortBy

func (g *Graph) ToposortBy(node Node) (sorted []string)

ToposortBy sorts topologically

type Node

type Node interface {
	ID() string
}

Node interface