edge_rank

edge_rank_eulerian

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.

A graph, while not "tidy" in itself, can be thought of as two
tidy data frames describing node and edge data respectively.
'tidygraph' provides an approach to manipulate these two virtual data
frames using the API defined in the 'dplyr' package, as well as
provides tidy interfaces to a lot of common graph algorithms.

Thomas Pedersen

tidygraph

A Tidy API for Graph Manipulation

Thomas Lin Pedersen

edge_rank function

<dl><dt>cyclic</dt>
<dd>should the eulerian path start and end at the same node</dd></dl>

Arguments

<ul>
<li><code>edge_rank_eulerian()</code>: 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
<code>NA</code>s</li>
</ul>

Functions

Calculate edge ranking — edge_rank

<dl>

<dt>cyclic</dt>
<dd>should the eulerian path start and end at the same node</dd>

</dl>

edge_rank: Calculate edge ranking

Description

Usage

Value

Arguments

Functions

Examples