Description Usage Arguments Details Value Examples
This function lists are simple paths from one source vertex to another vertex or vertices. A path is simple if the vertices it visits are not visited more than once.
1 2 3 4 5 6 7 
graph 
The input graph. 
from 
The source vertex. 
to 
The target vertex of vertices. Defaults to all vertices. 
mode 
Character constant, gives whether the shortest paths to or
from the given vertices should be calculated for directed graphs. If

cutoff 
Maximum length of path that is considered. If negative, paths of all lengths are considered. 
Note that potentially there are exponentially many paths between two vertices of a graph, and you may run out of memory when using this function, if your graph is latticelike.
This function currently ignored multiple and loop edges.
A list of integer vectors, each integer vector is a path from the source vertex to one of the target vertices. A path is given by its vertex ids.
1 2 3  g < make_ring(10)
all_simple_paths(g, 1, 5)
all_simple_paths(g, 1, c(3,5))

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