Persistent GraphCore for directed graph (DiGraph) that uses AddrRange as a key for each vertex. This is useful for handling CFGs of a binary.
Constructor | Description |
Full Usage:
PersistentRangedCore(init, edgeData, ?vertices, ?rangemap, ?edges, ?preds, ?succs)
Parameters:
GraphCore<'D, 'E, DiGraph<'D, 'E>> -> DiGraph<'D, 'E>
edgeData : 'E
?vertices : Map<VertexID, Vertex<'D>>
?rangemap : IntervalMap<Vertex<'D>>
?edges : Map<(VertexID * VertexID), (Vertex<'D> * Vertex<'D> * 'E)>
?preds : Map<VertexID, Vertex<'D> list>
?succs : Map<VertexID, Vertex<'D> list>
Returns: PersistentRangedCore<'D, 'E>
|
|