Directedg graph inehrited from Graph. This type is mostly used by primary graph algorithms, such as the dominator algorithm. We only expose static members here to make code consistent for both persistent and imperative graphs.

Trying to access dummy node's data

An edge in a directed graph.

Edge ID is a tuple of two node IDs (source node ID, destination node ID).

Missing edge.

The top-level graph data type. This one can be both directed or undirected.

GraphCore is an internal representation for the core graph operations, and this should not be directly accessed by the user.

Either persistent or imperative graph.

Imperative GraphCore for directed graph (DiGraph).

Imperative GraphCore for directed graph (DiGraph) that uses AddrRange as key for each vertex, which is useful for managing CFGs of a binary.

Imperative vertex.

Multiple vertices found when looking for a vertex containing certain data

Persistent GraphCore for directed graph (DiGraph).

Persistent GraphCore for directed graph (DiGraph) that uses AddrRange as a key for each vertex. This is useful for handling CFGs of a binary.

Persistent vertex.

A vertex of a graph. The vertex data (v) is optional, and if it is None, we will consider the vertex as a dummy node. Dummy nodes are useful for representing entry/exit node in a CFG.

A data type for vertex. A VertexData should have an ID.

A unique ID for a vertex.

Missing vertex.