edge_rank: Calculate edge ranking
In tidygraph: A Tidy API for Graph Manipulation
edge_rank R Documentation
Calculate edge ranking
Description
This set of functions tries to calculate a ranking of the edges in a graph so
that edges sharing certain topological traits are in proximity in the
resulting order.
Usage
edge_rank_eulerian(cyclic = FALSE)
Arguments
cyclic
should the eulerian path start and end at the same node
Value
An integer vector giving the position of each edge in the ranking
Functions
-
edge_rank_eulerian(): Calculcate ranking as the visit order of a eulerian
path or cycle. If no such path or cycle exist it will return a vector of
NAs
Examples
graph <- create_notable('meredith') %>%
activate(edges) %>%
mutate(rank = edge_rank_eulerian())
tidygraph documentation built on June 22, 2024, 11:32 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.
| edge_rank | R Documentation |
Calculate edge ranking
Description
This set of functions tries to calculate a ranking of the edges in a graph so that edges sharing certain topological traits are in proximity in the resulting order.
Usage
edge_rank_eulerian(cyclic = FALSE)
Arguments
cyclic |
should the eulerian path start and end at the same node |
Value
An integer vector giving the position of each edge in the ranking
Functions
-
edge_rank_eulerian(): Calculcate ranking as the visit order of a eulerian path or cycle. If no such path or cycle exist it will return a vector ofNAs
Examples
graph <- create_notable('meredith') %>%
activate(edges) %>%
mutate(rank = edge_rank_eulerian())
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.