graphtransliterator-ts / DirectedGraph
Interface: DirectedGraph<T, N, E>
Defined in: Graphs.ts:85
Monolithic directed graph topology with integrated neighborhood lookup acceleration indexes.
Type Parameters
T
T
Structural node classification type.
N
N
Vertex payload definition.
E
E
Edge transition cost payload definition.
Properties
edges
edges:
Map<string,Edge<E>>
Defined in: Graphs.ts:89
Hash lookup container connecting edge ID string coordinates directly to transition payloads.
nodes
nodes:
Node<T,N>[]
Defined in: Graphs.ts:87
Array collection keeping track of all registered nodes mapped directly to their ID positions.
predecessors
predecessors:
Map<number,Set<number>>
Defined in: Graphs.ts:93
Inverted index mapping a child NodeId back to its set of parent source NodeIds for O(1) lookbehinds.
successors
successors:
Map<number,Set<number>>
Defined in: Graphs.ts:91
Inverted index mapping a parent NodeId directly to its set of child target NodeIds for O(1) traversal.