Floyd-Warshall algorithm for shortest-path distances and total flows

Floyd-Warshall algorithm for shortest-path distances and total flows

rcpp_floyd_flow(C)

Arguments

C	numeric matrix of edge costs

Value

D matrix of shortest-path distances, i.e. sum of costs along minimising paths

F matrix of total flows, i.e. sum of inverse costs, along shortest-paths