This paper is review pending but the review hasn't started. Editor and reviewer assignments are happening over in GitHub over here »

yenpathy: An R Package to Quickly Find K Shortest Paths Through a Weighted Graph

yenpathy is an R package to quickly find k shortest paths through a weighted graph using Yen’s Algorithm. It provides the function k_shortest_paths(), which returns k shortest paths between two nodes in a graph, ordered from shortest to longest, with length determined by the sum of weights of consecutive edges.

Repository Address:

Public user content licensed CC BY 4.0 unless otherwise specified.
ISSN 2475-9066