ImperativeCore<'D, 'E> (B2R2)

ImperativeCore<'D, 'E> Type

Namespace: B2R2.MiddleEnd.BinGraph
Assembly: B2R2.MiddleEnd.BinGraph.dll
Base Type: GraphCore<'D, 'E, DiGraph<'D, 'E>>

Imperative GraphCore for directed graph (DiGraph).

Constructors

Constructor Description

Constructor	Description
`ImperativeCore(init, edgeData, ?vertices, ?edges, ?unreachables, ?exits)` Full Usage: `ImperativeCore(init, edgeData, ?vertices, ?edges, ?unreachables, ?exits)` Parameters: init : `GraphCore<'D, 'E, DiGraph<'D, 'E>> -> DiGraph<'D, 'E>` edgeData : `'E` ?vertices : `HashSet<Vertex<'D>>` ?edges : `Dictionary<(VertexID * VertexID), (Vertex<'D> * Vertex<'D> * 'E)>` ?unreachables : `HashSet<Vertex<'D>>` ?exits : `HashSet<Vertex<'D>>` Returns: `ImperativeCore<'D, 'E>`	init : `GraphCore<'D, 'E, DiGraph<'D, 'E>> -> DiGraph<'D, 'E>` edgeData : `'E` ?vertices : `HashSet<Vertex<'D>>` ?edges : `Dictionary<(VertexID * VertexID), (Vertex<'D> * Vertex<'D> * 'E)>` ?unreachables : `HashSet<Vertex<'D>>` ?exits : `HashSet<Vertex<'D>>` Returns: `ImperativeCore<'D, 'E>`


                
                  
                    
                      ImperativeCore(init, edgeData, ?vertices, ?edges, ?unreachables, ?exits)

Full Usage: ImperativeCore(init, edgeData, ?vertices, ?edges, ?unreachables, ?exits)

Parameters:

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

edgeData : 'E

?vertices : HashSet<Vertex<'D>>

?edges : Dictionary<(VertexID * VertexID), (Vertex<'D> * Vertex<'D> * 'E)>

?unreachables : HashSet<Vertex<'D>>

?exits : HashSet<Vertex<'D>>

Returns: ImperativeCore<'D, 'E>

init : GraphCore<'D, 'E, DiGraph<'D, 'E>> -> DiGraph<'D, 'E>
edgeData : 'E
?vertices : HashSet<Vertex<'D>>
?edges : Dictionary<(VertexID * VertexID), (Vertex<'D> * Vertex<'D> * 'E)>
?unreachables : HashSet<Vertex<'D>>
?exits : HashSet<Vertex<'D>>

Returns: ImperativeCore<'D, 'E>