dijkstra_inf {gretel} | R Documentation |
Find the shortest L-Inf norm paths to other vertices
dijkstra_inf(dist, src)
dist |
A matrix of distances between nodes |
src |
An integer vertex ID |
A numeric vector, entry i of which is the vertex immediately preceeding vertex i in the shortest path leading to i. Full paths must be constructed recursively.