Represents a dominator tree interface. A dominator tree is a tree where each node's children are those nodes it immediately dominates.

Raised when trying to access data from a dummy vertex that has no data.

Represents an edge of a graph.

Raised when an edge is not found in the graph.

Represents a directed graph (digraph) interface.

Represents a read-only directed graph information accessor. This interface provides a way to access the information of a directed graph without modifying it.

Represents an interface for computing dominance relationships of nodes in digraphs.

Represents an interface for computing dominance frontier of nodes in digraphs.

Represents an interface for providing dominance frontier instances.

Provides utility functions for the IGraph<'V, 'E> type.

Represents a graph interface.

Represents a read-only graph information accessor. This interface provides a way to access the information of a graph without modifying it.

Represents an imperative directed graph.

Represents an imperative vertex with mutable predecessor and successor lists.

Represents a graph implementation type, which can be either imperative or persistent.

Represents a strongly connected components enumerable. A graph is strongly connected if there is a path between every pair of vertices in the graph.

Represents a vertex of a graph.

Provides algorithms for loop detection in directed graphs.

Raised when there are multiple root vertices in a graph while only one is expected.

Represents a persistent directed graph.

Represents a persistent vertex.

Represents a serializable edge.

Represents a serializable graph. This is not supposed to be used as a graph representation in the middle-end, but rather as a temporary data structure for importing/exporting graphs.

Represents a serializable vertex.

Represents a serializer of a graph.

Represents a unique ID for a vertex.

Raised when a vertex is not found in the graph.