Documentation
¶
Overview ¶
Package graph implements a specialised directed acyclic graph (DAG) and the required topological sorting needed for spok's task dependency system.
Index ¶
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type Graph ¶
type Graph struct {
// contains filtered or unexported fields
}
Graph is a DAG designed to hold spok tasks.
func (*Graph) AddVertex ¶
AddVertex adds the passed vertex to the graph, if a vertex with that name already exists it will be overwritten.
func (*Graph) ContainsVertex ¶
ContainsVertex reports whether a graph contains a certain vertex.
type Vertex ¶
type Vertex struct {
Name string // Uniquely identifiable name
Task task.Task // The actual underlying task represented by this vertex
// contains filtered or unexported fields
}
Vertex represents a single node in the graph.
Click to show internal directories.
Click to hide internal directories.