<!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>Traversal — 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="Algorithms" href="algorithms.html" />
<link rel="next" title="dfs_edges" href="generated/networkx.algorithms.traversal.depth_first_search.dfs_edges.html" />
<link rel="prev" title="connected_double_edge_swap" href="generated/networkx.algorithms.swap.connected_double_edge_swap.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="generated/networkx.algorithms.traversal.depth_first_search.dfs_edges.html" title="dfs_edges"
accesskey="N">next</a> |</li>
<li class="right" >
<a href="generated/networkx.algorithms.swap.connected_double_edge_swap.html" title="connected_double_edge_swap"
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" accesskey="U">Algorithms</a> »</li>
</ul>
</div>
<div class="sphinxsidebar">
<div class="sphinxsidebarwrapper">
<h3><a href="../index.html">Table Of Contents</a></h3>
<ul>
<li><a class="reference internal" href="#">Traversal</a><ul>
<li><a class="reference internal" href="#module-networkx.algorithms.traversal.depth_first_search">Depth First Search</a><ul>
</ul>
</li>
<li><a class="reference internal" href="#module-networkx.algorithms.traversal.breadth_first_search">Breadth First Search</a><ul>
</ul>
</li>
</ul>
</li>
</ul>
<h4>Previous topic</h4>
<p class="topless"><a href="generated/networkx.algorithms.swap.connected_double_edge_swap.html"
title="previous chapter">connected_double_edge_swap</a></p>
<h4>Next topic</h4>
<p class="topless"><a href="generated/networkx.algorithms.traversal.depth_first_search.dfs_edges.html"
title="next chapter">dfs_edges</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="traversal">
<span id="id1"></span><h1>Traversal<a class="headerlink" href="#traversal" title="Permalink to this headline">¶</a></h1>
<div class="toctree-wrapper compound">
<ul class="simple">
</ul>
</div>
<div class="section" id="module-networkx.algorithms.traversal.depth_first_search">
<span id="depth-first-search"></span><h2>Depth First Search<a class="headerlink" href="#module-networkx.algorithms.traversal.depth_first_search" title="Permalink to this headline">¶</a></h2>
<p>Basic algorithms for depth-first searching.</p>
<p>Based on <a class="reference external" href="http://www.ics.uci.edu/~eppstein/PADS/DFS.py">http://www.ics.uci.edu/~eppstein/PADS/DFS.py</a>
by D. Eppstein, July 2004.</p>
<table border="1" class="longtable docutils">
<colgroup>
<col width="10%" />
<col width="90%" />
</colgroup>
<tbody valign="top">
<tr class="row-odd"><td><a class="reference internal" href="generated/networkx.algorithms.traversal.depth_first_search.dfs_edges.html#networkx.algorithms.traversal.depth_first_search.dfs_edges" title="networkx.algorithms.traversal.depth_first_search.dfs_edges"><tt class="xref py py-obj docutils literal"><span class="pre">dfs_edges</span></tt></a>(G[, source])</td>
<td>Produce edges in a depth-first-search starting at source.</td>
</tr>
<tr class="row-even"><td><a class="reference internal" href="generated/networkx.algorithms.traversal.depth_first_search.dfs_tree.html#networkx.algorithms.traversal.depth_first_search.dfs_tree" title="networkx.algorithms.traversal.depth_first_search.dfs_tree"><tt class="xref py py-obj docutils literal"><span class="pre">dfs_tree</span></tt></a>(G, source)</td>
<td>Return directed tree of depth-first-search from source.</td>
</tr>
<tr class="row-odd"><td><a class="reference internal" href="generated/networkx.algorithms.traversal.depth_first_search.dfs_predecessors.html#networkx.algorithms.traversal.depth_first_search.dfs_predecessors" title="networkx.algorithms.traversal.depth_first_search.dfs_predecessors"><tt class="xref py py-obj docutils literal"><span class="pre">dfs_predecessors</span></tt></a>(G[, source])</td>
<td>Return dictionary of predecessors in depth-first-search from source.</td>
</tr>
<tr class="row-even"><td><a class="reference internal" href="generated/networkx.algorithms.traversal.depth_first_search.dfs_successors.html#networkx.algorithms.traversal.depth_first_search.dfs_successors" title="networkx.algorithms.traversal.depth_first_search.dfs_successors"><tt class="xref py py-obj docutils literal"><span class="pre">dfs_successors</span></tt></a>(G[, source])</td>
<td>Return dictionary of successors in depth-first-search from source.</td>
</tr>
<tr class="row-odd"><td><a class="reference internal" href="generated/networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes.html#networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes" title="networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes"><tt class="xref py py-obj docutils literal"><span class="pre">dfs_preorder_nodes</span></tt></a>(G[, source])</td>
<td>Produce nodes in a depth-first-search pre-ordering starting at source.</td>
</tr>
<tr class="row-even"><td><a class="reference internal" href="generated/networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes.html#networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes" title="networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes"><tt class="xref py py-obj docutils literal"><span class="pre">dfs_postorder_nodes</span></tt></a>(G[, source])</td>
<td>Produce nodes in a depth-first-search post-ordering starting</td>
</tr>
<tr class="row-odd"><td><a class="reference internal" href="generated/networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges.html#networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges" title="networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges"><tt class="xref py py-obj docutils literal"><span class="pre">dfs_labeled_edges</span></tt></a>(G[, source])</td>
<td>Produce edges in a depth-first-search starting at source and</td>
</tr>
</tbody>
</table>
</div>
<div class="section" id="module-networkx.algorithms.traversal.breadth_first_search">
<span id="breadth-first-search"></span><h2>Breadth First Search<a class="headerlink" href="#module-networkx.algorithms.traversal.breadth_first_search" title="Permalink to this headline">¶</a></h2>
<p>Basic algorithms for breadth-first searching.</p>
<table border="1" class="longtable docutils">
<colgroup>
<col width="10%" />
<col width="90%" />
</colgroup>
<tbody valign="top">
<tr class="row-odd"><td><a class="reference internal" href="generated/networkx.algorithms.traversal.breadth_first_search.bfs_edges.html#networkx.algorithms.traversal.breadth_first_search.bfs_edges" title="networkx.algorithms.traversal.breadth_first_search.bfs_edges"><tt class="xref py py-obj docutils literal"><span class="pre">bfs_edges</span></tt></a>(G, source[, reverse])</td>
<td>Produce edges in a breadth-first-search starting at source.</td>
</tr>
<tr class="row-even"><td><a class="reference internal" href="generated/networkx.algorithms.traversal.breadth_first_search.bfs_tree.html#networkx.algorithms.traversal.breadth_first_search.bfs_tree" title="networkx.algorithms.traversal.breadth_first_search.bfs_tree"><tt class="xref py py-obj docutils literal"><span class="pre">bfs_tree</span></tt></a>(G, source[, reverse])</td>
<td>Return directed tree of breadth-first-search from source.</td>
</tr>
<tr class="row-odd"><td><a class="reference internal" href="generated/networkx.algorithms.traversal.breadth_first_search.bfs_predecessors.html#networkx.algorithms.traversal.breadth_first_search.bfs_predecessors" title="networkx.algorithms.traversal.breadth_first_search.bfs_predecessors"><tt class="xref py py-obj docutils literal"><span class="pre">bfs_predecessors</span></tt></a>(G, source)</td>
<td>Return dictionary of predecessors in breadth-first-search from source.</td>
</tr>
<tr class="row-even"><td><a class="reference internal" href="generated/networkx.algorithms.traversal.breadth_first_search.bfs_successors.html#networkx.algorithms.traversal.breadth_first_search.bfs_successors" title="networkx.algorithms.traversal.breadth_first_search.bfs_successors"><tt class="xref py py-obj docutils literal"><span class="pre">bfs_successors</span></tt></a>(G, source)</td>
<td>Return dictionary of successors in breadth-first-search from source.</td>
</tr>
</tbody>
</table>
</div>
</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="generated/networkx.algorithms.traversal.depth_first_search.dfs_edges.html" title="dfs_edges"
>next</a> |</li>
<li class="right" >
<a href="generated/networkx.algorithms.swap.connected_double_edge_swap.html" title="connected_double_edge_swap"
>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>
</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>
