IDiGraph<'V, 'E> (B2R2) | B2R2

IDiGraph<'V, 'E> Type

Namespace: B2R2.MiddleEnd.BinGraph
Assembly: B2R2.MiddleEnd.BinGraph.dll
Base Type: obj
All Interfaces: IDiGraph<'V, 'E> , IDiGraphAccessible<'V, 'E> , IGraphAccessible<'V, 'E>

Directed graph interface.

Instance members

Instance member	Description
`this.AddEdge` Full Usage: `this.AddEdge` Parameters: src : `IVertex<'V>` dst : `IVertex<'V>` label : `'E` Returns: `IDiGraph<'V, 'E>` Modifiers: abstract	Add an edge from src to dst with the given label. src : `IVertex<'V>` dst : `IVertex<'V>` label : `'E` Returns: `IDiGraph<'V, 'E>`
`this.AddEdge` Full Usage: `this.AddEdge` Parameters: src : `IVertex<'V>` dst : `IVertex<'V>` Returns: `IDiGraph<'V, 'E>` Modifiers: abstract	Add an edge from src to dst. src : `IVertex<'V>` dst : `IVertex<'V>` Returns: `IDiGraph<'V, 'E>`
`this.AddRoot` Full Usage: `this.AddRoot` Parameters: arg0 : `IVertex<'V>` Returns: `IDiGraph<'V, 'E>` Modifiers: abstract	Explicitly add a root vertex to this graph. `AddVertex` will automatically set the root vertex to the first vertex added to the graph, but this function allows the user to add root vertices explicitly. arg0 : `IVertex<'V>` Returns: `IDiGraph<'V, 'E>`
`this.AddVertex` Full Usage: `this.AddVertex` Returns: `IVertex<'V> * IDiGraph<'V, 'E>` Modifiers: abstract	Add a vertex to the grpah without any data attached to it. Returns: `IVertex<'V> * IDiGraph<'V, 'E>`
`this.AddVertex` Full Usage: `this.AddVertex` Parameters: data : `'V` vid : `VertexID` Returns: `IVertex<'V> * IDiGraph<'V, 'E>` Modifiers: abstract	Add a vertex to the graph using a data value and a vertex ID, and return a reference to the added vertex. This function assumes that the vertex ID is unique in the graph, thus it needs to be used with caution. data : `'V` vid : `VertexID` Returns: `IVertex<'V> * IDiGraph<'V, 'E>`
`this.AddVertex` Full Usage: `this.AddVertex` Parameters: data : `'V` Returns: `IVertex<'V> * IDiGraph<'V, 'E>` Modifiers: abstract	Add a vertex to the graph using a data value, and return a reference to the added vertex. data : `'V` Returns: `IVertex<'V> * IDiGraph<'V, 'E>`
`this.Clone` Full Usage: `this.Clone` Returns: `IDiGraph<'V, 'E>` Modifiers: abstract	Return a cloned copy of this graph. Returns: `IDiGraph<'V, 'E>`
`this.RemoveEdge` Full Usage: `this.RemoveEdge` Parameters: edge : `Edge<'V, 'E>` Returns: `IDiGraph<'V, 'E>` Modifiers: abstract	Remove the given edge from the graph. The input edge does not need to have the same label as the one in the graph; we only check the source and destination vertices to perform this operation. edge : `Edge<'V, 'E>` Returns: `IDiGraph<'V, 'E>`
`this.RemoveEdge` Full Usage: `this.RemoveEdge` Parameters: src : `IVertex<'V>` dst : `IVertex<'V>` Returns: `IDiGraph<'V, 'E>` Modifiers: abstract	Remove the edge that spans from src to dst. src : `IVertex<'V>` dst : `IVertex<'V>` Returns: `IDiGraph<'V, 'E>`
`this.RemoveVertex` Full Usage: `this.RemoveVertex` Parameters: arg0 : `IVertex<'V>` Returns: `IDiGraph<'V, 'E>` Modifiers: abstract	Remove the given vertex from the graph. arg0 : `IVertex<'V>` Returns: `IDiGraph<'V, 'E>`
`this.Reverse` Full Usage: `this.Reverse` Parameters: arg0 : `IEnumerable<IVertex<'V>>` Returns: `IDiGraph<'V, 'E>` Modifiers: abstract	Return a new transposed (i.e., reversed) graph. The given set of vertices will be used to set the root vertices of the transposed graph. arg0 : `IEnumerable<IVertex<'V>>` Returns: `IDiGraph<'V, 'E>`
`this.SetRoots` Full Usage: `this.SetRoots` Parameters: arg0 : `IEnumerable<IVertex<'V>>` Returns: `IDiGraph<'V, 'E>` Modifiers: abstract	Set root vertices for this graph. `AddVertex` will automatically set the root vertex to the first vertex added to the graph, but this function allows the user to set root vertices explicitly. arg0 : `IEnumerable<IVertex<'V>>` Returns: `IDiGraph<'V, 'E>`