EVOLUTION-MANAGER
Edit File: all_simple_paths.html
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><title>R: List all simple paths from one source</title> <meta http-equiv="Content-Type" content="text/html; charset=utf-8" /> <link rel="stylesheet" type="text/css" href="R.css" /> </head><body> <table width="100%" summary="page for all_simple_paths {igraph}"><tr><td>all_simple_paths {igraph}</td><td style="text-align: right;">R Documentation</td></tr></table> <h2>List all simple paths from one source</h2> <h3>Description</h3> <p>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. </p> <h3>Usage</h3> <pre> all_simple_paths( graph, from, to = V(graph), mode = c("out", "in", "all", "total"), cutoff = -1 ) </pre> <h3>Arguments</h3> <table summary="R argblock"> <tr valign="top"><td><code>graph</code></td> <td> <p>The input graph.</p> </td></tr> <tr valign="top"><td><code>from</code></td> <td> <p>The source vertex.</p> </td></tr> <tr valign="top"><td><code>to</code></td> <td> <p>The target vertex of vertices. Defaults to all vertices.</p> </td></tr> <tr valign="top"><td><code>mode</code></td> <td> <p>Character constant, gives whether the shortest paths to or from the given vertices should be calculated for directed graphs. If <code>out</code> then the shortest paths <em>from</em> the vertex, if <code>in</code> then <em>to</em> it will be considered. If <code>all</code>, the default, then the corresponding undirected graph will be used, ie. not directed paths are searched. This argument is ignored for undirected graphs.</p> </td></tr> <tr valign="top"><td><code>cutoff</code></td> <td> <p>Maximum length of path that is considered. If negative, paths of all lengths are considered.</p> </td></tr> </table> <h3>Details</h3> <p>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 lattice-like. </p> <p>This function currently ignored multiple and loop edges. </p> <h3>Value</h3> <p>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. </p> <h3>Examples</h3> <pre> g <- make_ring(10) all_simple_paths(g, 1, 5) all_simple_paths(g, 1, c(3,5)) </pre> <hr /><div style="text-align: center;">[Package <em>igraph</em> version 1.3.5 <a href="00Index.html">Index</a>]</div> </body></html>