AddReversedEdge adds a reversed edge for every passed edge and preserves the existing edge.

EdgesOfKind returns a new EdgeFunc accepting the provided kinds of edges If no kinds are specified, the returned EdgeFunc will accept all edges.

ExistingDirectEdge returns true if both from and to already exist in the graph and the edge kind is not ReferencedByEdgeKind (the generic reverse edge kind).

GetContainingNode returns the direct predecessor that is linked to the node by a ContainsEdgeKind.

GetTopLevelContainerNode traverses the reverse ContainsEdgeKind edges until it finds a node that does not have an inbound ContainsEdgeKind edge.

IsFromDifferentNamespace returns if a node is in a different namespace than the one provided.

New initializes a graph from input to output.

NodesOfKind returns a new NodeFunc accepting the provided kinds of nodes If no kinds are specified, the returned NodeFunc will accept all nodes.

RemoveInboundEdges returns a new EdgeFunc dismissing any inbound edges to the provided set of nodes.

ReverseExistingDirectEdge reverses the order of the edge and drops the existing edge only if both from and to already exist in the graph and the edge kind is not ReferencedByEdgeKind (the generic reverse edge kind).

ReverseGraphEdge reverses the order of the edge and drops the existing edge.

ContainsEdgeKind is the kind to use if one node's contents logically contain another node's contents.

ErrorSeverity is definitely wrong, this won't work.

InfoSeverity is interesting Currently used in missing probe markers.

ReferencedByEdgeKind is the kind to use if you're building reverse links that don't have a specific edge in the other direction other uses are discouraged.

WarningSeverity is probably wrong, but we aren't certain.

Marker is a struct that describes something interesting on a Node.

ExistenceChecker is an interface for those nodes that can be created without a backing object.

UniqueNodeInitializer is a graph that allows nodes with a unique name to be added without duplication.

ByID is a sorted group of nodes by ID.

EdgeFunc is passed a new graph, an edge in the current graph, and should mutate the new graph as needed.

MarkerScanner is a function for analyzing a graph and finding interesting things in it.

NodeFunc is passed a new graph, a node in the graph, and should return true if the node should be included.

Severity indicates how important this problem is.