ImperativeRangedCore<'D, 'E> Type
Imperative GraphCore for directed graph (DiGraph) that uses AddrRange as key for each vertex, which is useful for managing CFGs of a binary.
Constructors
| Constructor | Description |
Full Usage:
ImperativeRangedCore(init, edgeData, ?vertices, ?rangemap, ?edges, ?unreachables, ?exits)
Parameters:
GraphCore<'D, 'E, DiGraph<'D, 'E>> -> DiGraph<'D, 'E>
edgeData : 'E
?vertices : HashSet<Vertex<'D>>
?rangemap : IntervalMap<Vertex<'D>>
?edges : Dictionary<(VertexID * VertexID), (Vertex<'D> * Vertex<'D> * 'E)>
?unreachables : HashSet<Vertex<'D>>
?exits : HashSet<Vertex<'D>>
Returns: ImperativeRangedCore<'D, 'E>
|
|