shortest.path: Computes Shortest Path Distances for Selected Vertices
In dgraphs: Data-Derived Graph Construction Utilities
shortest.path R Documentation
Computes Shortest Path Distances for Selected Vertices
Description
Computes Shortest Path Distances for Selected Vertices
Usage
shortest.path(graph, edge.lengths, vertices)
Arguments
graph
A graph adjacency list using 1-based vertex indices.
edge.lengths
Edge-length list matching graph.
vertices
Integer vector of vertices for which to compute distances.
Value
A numeric matrix of shortest-path distances.
dgraphs documentation built on Aug. 21, 2026, 1:08 a.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
| shortest.path | R Documentation |
Computes Shortest Path Distances for Selected Vertices
Description
Computes Shortest Path Distances for Selected Vertices
Usage
shortest.path(graph, edge.lengths, vertices)
Arguments
graph |
A graph adjacency list using 1-based vertex indices. |
edge.lengths |
Edge-length list matching |
vertices |
Integer vector of vertices for which to compute distances. |
Value
A numeric matrix of shortest-path distances.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.