@graphty/algorithms / index / SsspResult
Interface: SsspResult ​
Defined in: indexed/dijkstra.ts:21
Single-source shortest paths, index-based (graph-format design 14.2 Port 2, line 3860). dist is a NumericVector rather than the design's F64 because ONE declaration serves both the CPU port (which produces a Float64Array) and the dispatcher's decoration of an accelerator's f32 result (plan decision PD-3, departure DEP-8A-C).
Extended by ​
Properties ​
dist ​
readonlydist:NumericVector
Defined in: indexed/dijkstra.ts:23
Distance per node; +Infinity for unreached nodes.
predArc ​
readonlypredArc:U32
Defined in: indexed/dijkstra.ts:25
The ARC that relaxed each node; INVALID_INDEX for the source and for unreached nodes.
Methods ​
pathEdges() ​
pathEdges(
target):U32
Defined in: indexed/dijkstra.ts:36
LOGICAL EDGE indices along that path, one fewer than pathTo; this is what graphty-element's isInPath writes through. Empty when target is unreached.
Parameters ​
target ​
NodeRef
The node to walk back from: its index, or { id }
Returns ​
U32
pathTo() ​
pathTo(
target):U32
Defined in: indexed/dijkstra.ts:30
Node indices from the source to target inclusive; empty when target is unreached.
Parameters ​
target ​
NodeRef
The node to walk back from: its index, or { id }
Returns ​
U32