Class RecursorContext<TGraph>
Constructors
constructor
- new RecursorContext<TGraph>(graph, inputNodes, currentInputNode, source, target, path): RecursorContext<TGraph>
Type Parameters
TGraph extends default<Attributes, Attributes, Attributes>
Parameters
graph: TGraph
inputNodes: Set<string>
currentInputNode: string
source: string
target: string
path: string[]
Properties
currentInputNode
currentInputNode: string
inputNodes
inputNodes: Set<string>
Methods
directedEdges
- directedEdges(): string[]
Returns string[]
edge
- edge(): string
Returns string
edges
- edges(): string[]
Returns string[]
filterEdges
- filterEdges(cb): string[]
Returns string[]
forEachEdge
- forEachEdge(cb): void
Returns void
forEachEdgeEntry
- forEachEdgeEntry(cb): void
Returns void
inEdges
- inEdges(): string[]
Returns string[]
inboundEdges
- inboundEdges(): string[]
Returns string[]
mapEdges
- mapEdges<TReturn>(cb): TReturn[]
Returns TReturn[]
mapFilterEdgeEntries
- mapFilterEdgeEntries<TReturn>(cb): Exclude<TReturn, undefined>[]
Returns Exclude<TReturn, undefined>[]
mapFilterEdges
- mapFilterEdges<TReturn>(cb): Exclude<TReturn, undefined>[]
Returns Exclude<TReturn, undefined>[]
outEdges
- outEdges(): string[]
Returns string[]
outboundEdges
- outboundEdges(): string[]
Returns string[]
undirectedEdge
- undirectedEdge(): undefined | string
Returns undefined | string
Represents a context for graph recursion.
Provides a subset of node/edge query methods similar to a graph, but with the source and target nodes passed in as the node and neighbor parameters.