R: Node properties related to the graph topology

node_topology {tidygraph} | R Documentation

## Node properties related to the graph topology

### Description

These functions calculate properties that are dependent on the overall topology of the graph.

### Usage

    node_dominator(root, mode = "out")

    node_topo_order(mode = "out")

### Arguments

`root` | The node to start the dominator search from
`mode` | How should edges be followed. Either `'in'` or `'out'`

### Value

A vector of the same length as the number of nodes in the graph

### Functions

- `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()`.

### Examples

    # 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())

[Package tidygraph version 1.1.2 Index]