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.

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.

Graph is used to represent a dependency graph.

Set is a set data structure.

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

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.

Vertex of the graph.

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

WalkFunc is the callback used for walking the graph.