path.length.hist: Shortest (directed or undirected) paths between vertices
In igraph/rigraph: Network Analysis and Visualization
path.length.hist R Documentation
Shortest (directed or undirected) paths between vertices
Description
![[Deprecated]](../help/figures/lifecycle-deprecated.svg)
path.length.hist() was renamed to distance_table() to create a more
consistent API.
Usage
path.length.hist(graph, directed = TRUE)
Arguments
graph
The graph to work on.
directed
Whether to consider directed paths in directed graphs,
this argument is ignored for undirected graphs.
igraph/rigraph documentation built on May 19, 2024, 6:19 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.
| path.length.hist | R Documentation |
Shortest (directed or undirected) paths between vertices
Description
path.length.hist() was renamed to distance_table() to create a more
consistent API.
Usage
path.length.hist(graph, directed = TRUE)
Arguments
graph |
The graph to work on. |
directed |
Whether to consider directed paths in directed graphs, this argument is ignored for undirected graphs. |
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.