SingleSourceShortestPathsSolution.reverseShortestPath

Traverse shortest path from dest to startNode; empty if !isConnected(dest).

struct SingleSourceShortestPathsSolution(weight_t)

const pure nothrow

ReverseShortestPath

reverseShortestPath

(

size_t dest

)

if (

isNumeric!weight_t

)

Meta

Source

See Implementation

dalicious algorithm graph SingleSourceShortestPathsSolution functions

reverseShortestPath

manifest constants

properties

structs

ReverseShortestPath

variables