simple convenience helper for converting a dag.Set to a []Vertex.

BasicEdge returns an Edge implementation that simply tracks the source and target given as-is.

NewWalker creates a new walker with the given callback function.

StronglyConnected returns the list of strongly connected components within the Graph g.

VertexName returns the name of a vertex.

AcyclicGraph is a specialization of Graph that cannot have cycles.

DotNode provides a structure for Vertices to return in order to specify their dot format.

DotOpts are the options for generating a dot formatted Graph.

Graph is used to represent a dependency graph.

Walker is used to walk every vertex of a graph in parallel.

Edge represents an edge in the graph, with a source and target vertex.

A Grapher is any type that returns a Grapher, mainly used to identify dag.Graph and dag.AcyclicGraph.

GraphNodeDotter can be implemented by a node to cause it to be included in the dot graph.

Hashable is the interface used by set to get the hash code of a value.

NamedVertex is an optional interface that can be implemented by Vertex to give it a human-friendly name that is used for outputting the graph.

Subgrapher allows a Vertex to be a Graph itself, by returning a Grapher.

Vertex of the graph.

DepthWalkFunc is a walk function that also receives the current depth of the walk as an argument.

Set is a set data structure.

WalkFunc is the callback used for walking the graph.