Description Usage Arguments Value Functions Examples
These functions wraps the igraph::bfs()
and igraph::dfs()
functions to
provide a consistent return value that can be used in dplyr::mutate()
calls. Each function returns an integer vector with values matching the order
of the nodes in the graph.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17  bfs_rank(root, mode = "out", unreachable = FALSE)
bfs_parent(root, mode = "out", unreachable = FALSE)
bfs_before(root, mode = "out", unreachable = FALSE)
bfs_after(root, mode = "out", unreachable = FALSE)
bfs_dist(root, mode = "out", unreachable = FALSE)
dfs_rank(root, mode = "out", unreachable = FALSE)
dfs_rank_out(root, mode = "out", unreachable = FALSE)
dfs_parent(root, mode = "out", unreachable = FALSE)
dfs_dist(root, mode = "out", unreachable = FALSE)

root 
The node to start the search from 
mode 
How edges are followed in the search if the graph is directed.

unreachable 
Should the search jump to a new component if the search is
terminated without all nodes being visited? Default to 
An integer vector, the nature of which is determined by the function.
bfs_rank
: Get the succession in which the nodes are visited in a breath first search
bfs_parent
: Get the nodes from which each node is visited in a breath first search
bfs_before
: Get the node that was visited before each node in a breath first search
bfs_after
: Get the node that was visited after each node in a breath first search
bfs_dist
: Get the number of nodes between the root and each node in a breath first search
dfs_rank
: Get the succession in which the nodes are visited in a depth first search
dfs_rank_out
: Get the succession in which each nodes subtree is completed in a depth first search
dfs_parent
: Get the nodes from which each node is visited in a depth first search
dfs_dist
: Get the number of nodes between the root and each node in a depth first search
1 2 3 4 5 6 7 8 9 10 
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.