graph

Documentation

Index

• type D
• type Graph
  • func NewGraph(size int) *Graph
  • func (g *Graph) AddEdge(from, to V) error
  • func (g *Graph) AddVertex(name V, data D)
  • func (g *Graph) ContainsVertex(name V) bool
  • func (g *Graph) TopologicalSort() ([]V, error)
• type V
• type Vertex

Types

type D

type D interface{}

D is data attached to the vertex.

type Graph

type Graph struct {
	// Vertices is a map from resource name to resource vertex.
	Vertices map[V]*Vertex
	// contains filtered or unexported fields
}

Graph is a graph representation of resource dependencies.

func NewGraph

func NewGraph(size int) *Graph

func (*Graph) AddEdge

func (g *Graph) AddEdge(from, to V) error

func (*Graph) AddVertex

func (g *Graph) AddVertex(name V, data D)

func (*Graph) ContainsVertex

func (g *Graph) ContainsVertex(name V) bool

func (*Graph) TopologicalSort

func (g *Graph) TopologicalSort() ([]V, error)

type V

type V interface{}

V is name of the vertex.

type Vertex

type Vertex struct {
	// Edges in order of appearance (for deterministic order after sort).
	OutgoingEdges []V
	// Edges in the inverse of outgoing, i.e. vertices that depend on this vertex
	IncomingEdges []V
	Data          D
}

Vertex is a resource representation in a dependency graph.