compute.graph.distance: Compute a Weighted Shortest-Path Distance
In dgraphs: Data-Derived Graph Construction Utilities
compute.graph.distance R Documentation
Compute a Weighted Shortest-Path Distance
Description
Compute a Weighted Shortest-Path Distance
Usage
compute.graph.distance(
star.obj = NULL,
i,
j,
adj.list = NULL,
edge.lengths = NULL
)
Arguments
star.obj
Optional object containing adj.list and edge.lengths.
i
Source vertex.
j
Target vertex.
adj.list
Adjacency list.
edge.lengths
Edge-length list matching adj.list.
Value
Numeric shortest-path distance.
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.
| compute.graph.distance | R Documentation |
Compute a Weighted Shortest-Path Distance
Description
Compute a Weighted Shortest-Path Distance
Usage
compute.graph.distance(
star.obj = NULL,
i,
j,
adj.list = NULL,
edge.lengths = NULL
)
Arguments
star.obj |
Optional object containing |
i |
Source vertex. |
j |
Target vertex. |
adj.list |
Adjacency list. |
edge.lengths |
Edge-length list matching |
Value
Numeric shortest-path distance.
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.