B2R2.MiddleEnd.BinGraph

B2R2.MiddleEnd.BinGraph Namespace

Type/Module	Description
DominatorTree<'V, 'E>	Dominator tree interface. A dominator tree is a tree where each node's children are those nodes it immediately dominates.
DummyDataAccessException	Raised when trying to access data from a dummy vertex that has no data.
Edge<'V, 'E>	Edge of a graph.
EdgeNotFoundException	Missing edge.
IDiGraph<'V, 'E>	Directed graph interface.
IDiGraphAccessible<'V, 'E>	Read-only directed graph information accessor. This interface provides a way to access the information of a directed graph without modifying it.
IDominance<'V, 'E>	Interface for computing dominance relationships of nodes in digraphs.
IDominanceFrontier<'V, 'E>	Interface for computing dominance frontier of nodes in digraphs.
IDominanceFrontierProvider<'V, 'E>	Interface for providing dominance frontier instances.
IGraph	Module for IGraph<'V, 'E> type to provide utility functions.
IGraph<'V, 'E>	Graph interface.
IGraphAccessible<'V, 'E>	Read-only graph information accessor. This interface provides a way to access the information of a graph without modifying it.
ImperativeDiGraph<'V, 'E>	Imperative directed graph.
ImperativeVertex<'V>	Imperative vertex.
ImplementationType	Graph implementation type.
ISCCEnumerable<'V>	Strongly connected components enumerable. A graph is strongly connected if there is a path between every pair of vertices in the graph.
IVertex<'V>	Represents a vertex of a graph.
Loop
MultipleRootVerticesException	Raised when there are multiple root vertices in a graph while only one is expected.
PersistentDiGraph<'V, 'E>	Persistent directed graph.
PersistentVertex<'V>	Persistent vertex.
SCC
Serializer	The serializer of a graph.
VertexID	Represents a unique ID for a vertex.
VertexNotFoundException	Raised when a vertex is not found in the graph.