PersistentDiGraph<'V, 'E> (B2R2)

PersistentDiGraph<'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>

Persistent directed graph.

Constructor Description

Constructor	Description
`PersistentDiGraph()` Full Usage: `PersistentDiGraph()` Returns: `PersistentDiGraph<'V, 'E>`	Returns: `PersistentDiGraph<'V, 'E>`
`PersistentDiGraph(roots, vs, preds, succs, id)` Full Usage: `PersistentDiGraph(roots, vs, preds, succs, id)` Parameters: roots : `IVertex<'V> list` vs : `Map<VertexID, PersistentVertex<'V>>` preds : `Map<VertexID, Edge<'V, 'E> list>` succs : `Map<VertexID, Edge<'V, 'E> list>` id : `VertexID` Returns: `PersistentDiGraph<'V, 'E>`	roots : `IVertex<'V> list` vs : `Map<VertexID, PersistentVertex<'V>>` preds : `Map<VertexID, Edge<'V, 'E> list>` succs : `Map<VertexID, Edge<'V, 'E> list>` id : `VertexID` Returns: `PersistentDiGraph<'V, 'E>`


                
                  
                    
                      PersistentDiGraph()

Full Usage: PersistentDiGraph()

Returns: PersistentDiGraph<'V, 'E>


                
                  
                    
                      PersistentDiGraph(roots, vs, preds, succs, id)

Full Usage: PersistentDiGraph(roots, vs, preds, succs, id)

Parameters:

roots : IVertex<'V> list

vs : Map<VertexID, PersistentVertex<'V>>

preds : Map<VertexID, Edge<'V, 'E> list>

succs : Map<VertexID, Edge<'V, 'E> list>

id : VertexID

Returns: PersistentDiGraph<'V, 'E>