<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> <html xmlns="http://www.w3.org/1999/xhtml"> <head> <meta http-equiv="Content-Type" content="text/html; charset=utf-8" /> <title>single_source_shortest_path — NetworkX 1.8.1 documentation</title> <link rel="stylesheet" href="../../_static/networkx.css" type="text/css" /> <link rel="stylesheet" href="../../_static/pygments.css" type="text/css" /> <script type="text/javascript"> var DOCUMENTATION_OPTIONS = { URL_ROOT: '../../', VERSION: '1.8.1', COLLAPSE_INDEX: false, FILE_SUFFIX: '.html', HAS_SOURCE: false }; </script> <script type="text/javascript" src="../../_static/jquery.js"></script> <script type="text/javascript" src="../../_static/underscore.js"></script> <script type="text/javascript" src="../../_static/doctools.js"></script> <link rel="search" type="application/opensearchdescription+xml" title="Search within NetworkX 1.8.1 documentation" href="../../_static/opensearch.xml"/> <link rel="top" title="NetworkX 1.8.1 documentation" href="../../index.html" /> <link rel="up" title="Shortest Paths" href="../algorithms.shortest_paths.html" /> <link rel="next" title="single_source_shortest_path_length" href="networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length.html" /> <link rel="prev" title="has_path" href="networkx.algorithms.shortest_paths.generic.has_path.html" /> </head> <body> <div style="color: black;background-color: white; font-size: 3.2em; text-align: left; padding: 15px 10px 10px 15px"> NetworkX </div> <div class="related"> <h3>Navigation</h3> <ul> <li class="right" style="margin-right: 10px"> <a href="../../genindex.html" title="General Index" accesskey="I">index</a></li> <li class="right" > <a href="../../py-modindex.html" title="Python Module Index" >modules</a> |</li> <li class="right" > <a href="networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length.html" title="single_source_shortest_path_length" accesskey="N">next</a> |</li> <li class="right" > <a href="networkx.algorithms.shortest_paths.generic.has_path.html" title="has_path" accesskey="P">previous</a> |</li> <li><a href="http://networkx.github.com/">NetworkX Home </a> | </li> <li><a href="http://networkx.github.com/documentation.html">Documentation </a>| </li> <li><a href="http://networkx.github.com/download.html">Download </a> | </li> <li><a href="http://github.com/networkx">Developer (Github)</a></li> <li><a href="../index.html" >Reference</a> »</li> <li><a href="../pdf_reference.html" >Reference</a> »</li> <li><a href="../algorithms.html" >Algorithms</a> »</li> <li><a href="../algorithms.shortest_paths.html" accesskey="U">Shortest Paths</a> »</li> </ul> </div> <div class="sphinxsidebar"> <div class="sphinxsidebarwrapper"> <h4>Previous topic</h4> <p class="topless"><a href="networkx.algorithms.shortest_paths.generic.has_path.html" title="previous chapter">has_path</a></p> <h4>Next topic</h4> <p class="topless"><a href="networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length.html" title="next chapter">single_source_shortest_path_length</a></p> <div id="searchbox" style="display: none"> <h3>Quick search</h3> <form class="search" action="../../search.html" method="get"> <input type="text" name="q" /> <input type="submit" value="Go" /> <input type="hidden" name="check_keywords" value="yes" /> <input type="hidden" name="area" value="default" /> </form> <p class="searchtip" style="font-size: 90%"> Enter search terms or a module, class or function name. </p> </div> <script type="text/javascript">$('#searchbox').show(0);</script> </div> </div> <div class="document"> <div class="documentwrapper"> <div class="bodywrapper"> <div class="body"> <div class="section" id="single-source-shortest-path"> <h1>single_source_shortest_path<a class="headerlink" href="#single-source-shortest-path" title="Permalink to this headline">¶</a></h1> <dl class="function"> <dt id="networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path"> <tt class="descname">single_source_shortest_path</tt><big>(</big><em>G</em>, <em>source</em>, <em>cutoff=None</em><big>)</big><a class="reference internal" href="../../_modules/networkx/algorithms/shortest_paths/unweighted.html#single_source_shortest_path"><span class="viewcode-link">[source]</span></a><a class="headerlink" href="#networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path" title="Permalink to this definition">¶</a></dt> <dd><p>Compute shortest path between source and all other nodes reachable from source.</p> <table class="docutils field-list" frame="void" rules="none"> <col class="field-name" /> <col class="field-body" /> <tbody valign="top"> <tr class="field-odd field"><th class="field-name">Parameters :</th><td class="field-body"><p class="first"><strong>G</strong> : NetworkX graph</p> <p><strong>source</strong> : node label</p> <blockquote> <div><p>Starting node for path</p> </div></blockquote> <p><strong>cutoff</strong> : integer, optional</p> <blockquote> <div><p>Depth to stop the search. Only paths of length <= cutoff are returned.</p> </div></blockquote> </td> </tr> <tr class="field-even field"><th class="field-name">Returns :</th><td class="field-body"><p class="first"><strong>lengths</strong> : dictionary</p> <blockquote class="last"> <div><p>Dictionary, keyed by target, of shortest paths.</p> </div></blockquote> </td> </tr> </tbody> </table> <div class="admonition-see-also admonition seealso"> <p class="first admonition-title">See also</p> <p class="last"><tt class="xref py py-obj docutils literal"><span class="pre">shortest_path</span></tt></p> </div> <p class="rubric">Notes</p> <p>The shortest path is not necessarily unique. So there can be multiple paths between the source and each target node, all of which have the same ‘shortest’ length. For each target node, this function returns only one of those paths.</p> <p class="rubric">Examples</p> <div class="highlight-python"><div class="highlight"><pre><span class="gp">>>> </span><span class="n">G</span><span class="o">=</span><span class="n">nx</span><span class="o">.</span><span class="n">path_graph</span><span class="p">(</span><span class="mi">5</span><span class="p">)</span> <span class="gp">>>> </span><span class="n">path</span><span class="o">=</span><span class="n">nx</span><span class="o">.</span><span class="n">single_source_shortest_path</span><span class="p">(</span><span class="n">G</span><span class="p">,</span><span class="mi">0</span><span class="p">)</span> <span class="gp">>>> </span><span class="n">path</span><span class="p">[</span><span class="mi">4</span><span class="p">]</span> <span class="go">[0, 1, 2, 3, 4]</span> </pre></div> </div> </dd></dl> </div> </div> </div> </div> <div class="clearer"></div> </div> <div class="related"> <h3>Navigation</h3> <ul> <li class="right" style="margin-right: 10px"> <a href="../../genindex.html" title="General Index" >index</a></li> <li class="right" > <a href="../../py-modindex.html" title="Python Module Index" >modules</a> |</li> <li class="right" > <a href="networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length.html" title="single_source_shortest_path_length" >next</a> |</li> <li class="right" > <a href="networkx.algorithms.shortest_paths.generic.has_path.html" title="has_path" >previous</a> |</li> <li><a href="http://networkx.github.com/">NetworkX Home </a> | </li> <li><a href="http://networkx.github.com/documentation.html">Documentation </a>| </li> <li><a href="http://networkx.github.com/download.html">Download </a> | </li> <li><a href="http://github.com/networkx">Developer (Github)</a></li> <li><a href="../index.html" >Reference</a> »</li> <li><a href="../pdf_reference.html" >Reference</a> »</li> <li><a href="../algorithms.html" >Algorithms</a> »</li> <li><a href="../algorithms.shortest_paths.html" >Shortest Paths</a> »</li> </ul> </div> <div class="footer"> © Copyright 2013, NetworkX Developers. Last updated on Oct 23, 2013. Created using <a href="http://sphinx.pocoo.org/">Sphinx</a> 1.1.3. </div> </body> </html>