Description Usage Arguments Value Examples
Obtain a list of all possible paths from a given node within a directed graph
1 2 
graph 
a graph object of class

from 
the node from which all paths will be determined. 
to 
the node to which all paths will be determined. 
shortest_path 
an option to return paths that are the shortest in the set of all determined paths. 
longest_path 
an option to return paths that are the longest in the set of all determined paths. 
distance 
a vector of integer values that specify which of the valid paths to return when filtering by distance. 
a list of paths, sorted by ascending traversal length, comprising vectors of node IDs in sequence of traversal through the graph.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47  # Create a simple graph
graph <
create_graph() %>%
add_n_nodes(n = 8) %>%
add_edge(from = 1, to = 2) %>%
add_edge(from = 1, to = 3) %>%
add_edge(from = 3, to = 4) %>%
add_edge(from = 3, to = 5) %>%
add_edge(from = 4, to = 6) %>%
add_edge(from = 2, to = 7) %>%
add_edge(from = 7, to = 5) %>%
add_edge(from = 4, to = 8)
# Get a list of all paths outward from node `1`
graph %>%
get_paths(from = 1)
# Get a list of all paths leading to node `6`
graph %>%
get_paths(to = 6)
# Get a list of all paths from `1` to `5`
graph %>%
get_paths(
from = 1,
to = 5)
# Get a list of all paths from `1` up to a distance
# of 2 node traversals
graph %>%
get_paths(
from = 1,
distance = 2)
# Get a list of the shortest paths from `1` to `5`
get_paths(
graph,
from = 1,
to = 5,
shortest_path = TRUE)
# Get a list of the longest paths from `1` to `5`
get_paths(
graph,
from = 1,
to = 5,
longest_path = TRUE)

Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.