Description Usage Arguments Value Functions Examples
These functions calculate properties that are dependent on the overall topology of the graph.
1 2 3  node_dominator(root, mode = "out")
node_topo_order(mode = "out")

root 
The node to start the dominator search from 
mode 
How should edges be followed. Either 
A vector of the same length as the number of nodes in the graph
node_dominator
: Get the immediate dominator of each node. Wraps igraph::dominator_tree()
.
node_topo_order
: Get the topological order of nodes in a DAG. Wraps igraph::topo_sort()
.
1 2 3 4 5  # Sort a graph based on its topological order
create_tree(10, 2) %>%
arrange(sample(graph_order())) %>%
mutate(old_ind = seq_len(graph_order())) %>%
arrange(node_topo_order())

Attaching package: 'tidygraph'
The following object is masked from 'package:stats':
filter
# A tbl_graph: 10 nodes and 9 edges
#
# A rooted tree
#
# Node Data: 10 x 1 (active)
old_ind
<int>
1 9
2 3
3 4
4 2
5 7
6 6
# ... with 4 more rows
#
# Edge Data: 9 x 2
from to
<int> <int>
1 1 3
2 1 2
3 3 6
# ... with 6 more rows
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.