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.

`edge_rank_eulerian(cyclic = FALSE)`

- cyclic
should the eulerian path start and end at the same node

An integer vector giving the position of each edge in the ranking

`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`NA`

s

```
graph <- create_notable('meredith') %>%
activate(edges) %>%
mutate(rank = edge_rank_eulerian())
```