PersistentCore<'D, 'E> (B2R2)

PersistentCore<'D, 'E> Type

Persistent GraphCore for directed graph (DiGraph).

Constructor Description

Constructor	Description
`PersistentCore(init, edgeData, ?vertices, ?preds, ?succs)` Full Usage: `PersistentCore(init, edgeData, ?vertices, ?preds, ?succs)` Parameters: init : `GraphCore<'D, 'E, DiGraph<'D, 'E>> -> DiGraph<'D, 'E>` edgeData : `'E` ?vertices : `Map<VertexID, Vertex<'D>>` ?preds : `Map<VertexID, (Vertex<'D> * Vertex<'D> * 'E) list>` ?succs : `Map<VertexID, (Vertex<'D> * Vertex<'D> * 'E) list>` Returns: `PersistentCore<'D, 'E>`	init : `GraphCore<'D, 'E, DiGraph<'D, 'E>> -> DiGraph<'D, 'E>` edgeData : `'E` ?vertices : `Map<VertexID, Vertex<'D>>` ?preds : `Map<VertexID, (Vertex<'D> * Vertex<'D> * 'E) list>` ?succs : `Map<VertexID, (Vertex<'D> * Vertex<'D> * 'E) list>` Returns: `PersistentCore<'D, 'E>`


                
                  
                    
                      PersistentCore(init, edgeData, ?vertices, ?preds, ?succs)

Full Usage: PersistentCore(init, edgeData, ?vertices, ?preds, ?succs)

Parameters:

init : GraphCore<'D, 'E, DiGraph<'D, 'E>> -> DiGraph<'D, 'E>

edgeData : 'E

?vertices : Map<VertexID, Vertex<'D>>

?preds : Map<VertexID, (Vertex<'D> * Vertex<'D> * 'E) list>

?succs : Map<VertexID, (Vertex<'D> * Vertex<'D> * 'E) list>

Returns: PersistentCore<'D, 'E>