<!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>Flows — 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="max_flow" href="generated/networkx.algorithms.flow.max_flow.html" /> <link rel="prev" title="eulerian_circuit" href="generated/networkx.algorithms.euler.eulerian_circuit.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.flow.max_flow.html" title="max_flow" accesskey="N">next</a> |</li> <li class="right" > <a href="generated/networkx.algorithms.euler.eulerian_circuit.html" title="eulerian_circuit" 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="#">Flows</a><ul> <li><a class="reference internal" href="#ford-fulkerson">Ford-Fulkerson</a><ul> </ul> </li> <li><a class="reference internal" href="#network-simplex">Network Simplex</a><ul> </ul> </li> </ul> </li> </ul> <h4>Previous topic</h4> <p class="topless"><a href="generated/networkx.algorithms.euler.eulerian_circuit.html" title="previous chapter">eulerian_circuit</a></p> <h4>Next topic</h4> <p class="topless"><a href="generated/networkx.algorithms.flow.max_flow.html" title="next chapter">max_flow</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="module-networkx.algorithms.flow"> <span id="flows"></span><h1>Flows<a class="headerlink" href="#module-networkx.algorithms.flow" title="Permalink to this headline">¶</a></h1> <div class="section" id="ford-fulkerson"> <h2>Ford-Fulkerson<a class="headerlink" href="#ford-fulkerson" title="Permalink to this headline">¶</a></h2> <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.flow.max_flow.html#networkx.algorithms.flow.max_flow" title="networkx.algorithms.flow.max_flow"><tt class="xref py py-obj docutils literal"><span class="pre">max_flow</span></tt></a>(G, s, t[, capacity])</td> <td>Find the value of a maximum single-commodity flow.</td> </tr> <tr class="row-even"><td><a class="reference internal" href="generated/networkx.algorithms.flow.min_cut.html#networkx.algorithms.flow.min_cut" title="networkx.algorithms.flow.min_cut"><tt class="xref py py-obj docutils literal"><span class="pre">min_cut</span></tt></a>(G, s, t[, capacity])</td> <td>Compute the value of a minimum (s, t)-cut.</td> </tr> <tr class="row-odd"><td><a class="reference internal" href="generated/networkx.algorithms.flow.ford_fulkerson.html#networkx.algorithms.flow.ford_fulkerson" title="networkx.algorithms.flow.ford_fulkerson"><tt class="xref py py-obj docutils literal"><span class="pre">ford_fulkerson</span></tt></a>(G, s, t[, capacity])</td> <td>Find a maximum single-commodity flow using the Ford-Fulkerson</td> </tr> <tr class="row-even"><td><a class="reference internal" href="generated/networkx.algorithms.flow.ford_fulkerson_flow.html#networkx.algorithms.flow.ford_fulkerson_flow" title="networkx.algorithms.flow.ford_fulkerson_flow"><tt class="xref py py-obj docutils literal"><span class="pre">ford_fulkerson_flow</span></tt></a>(G, s, t[, capacity])</td> <td>Return a maximum flow for a single-commodity flow problem.</td> </tr> <tr class="row-odd"><td><a class="reference internal" href="generated/networkx.algorithms.flow.ford_fulkerson_flow_and_auxiliary.html#networkx.algorithms.flow.ford_fulkerson_flow_and_auxiliary" title="networkx.algorithms.flow.ford_fulkerson_flow_and_auxiliary"><tt class="xref py py-obj docutils literal"><span class="pre">ford_fulkerson_flow_and_auxiliary</span></tt></a>(G, s, t[, ...])</td> <td>Find a maximum single-commodity flow using the Ford-Fulkerson</td> </tr> </tbody> </table> </div> <div class="section" id="network-simplex"> <h2>Network Simplex<a class="headerlink" href="#network-simplex" title="Permalink to this headline">¶</a></h2> <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.flow.network_simplex.html#networkx.algorithms.flow.network_simplex" title="networkx.algorithms.flow.network_simplex"><tt class="xref py py-obj docutils literal"><span class="pre">network_simplex</span></tt></a>(G[, demand, capacity, weight])</td> <td>Find a minimum cost flow satisfying all demands in digraph G.</td> </tr> <tr class="row-even"><td><a class="reference internal" href="generated/networkx.algorithms.flow.min_cost_flow_cost.html#networkx.algorithms.flow.min_cost_flow_cost" title="networkx.algorithms.flow.min_cost_flow_cost"><tt class="xref py py-obj docutils literal"><span class="pre">min_cost_flow_cost</span></tt></a>(G[, demand, capacity, weight])</td> <td>Find the cost of a minimum cost flow satisfying all demands in digraph G.</td> </tr> <tr class="row-odd"><td><a class="reference internal" href="generated/networkx.algorithms.flow.min_cost_flow.html#networkx.algorithms.flow.min_cost_flow" title="networkx.algorithms.flow.min_cost_flow"><tt class="xref py py-obj docutils literal"><span class="pre">min_cost_flow</span></tt></a>(G[, demand, capacity, weight])</td> <td>Return a minimum cost flow satisfying all demands in digraph G.</td> </tr> <tr class="row-even"><td><a class="reference internal" href="generated/networkx.algorithms.flow.cost_of_flow.html#networkx.algorithms.flow.cost_of_flow" title="networkx.algorithms.flow.cost_of_flow"><tt class="xref py py-obj docutils literal"><span class="pre">cost_of_flow</span></tt></a>(G, flowDict[, weight])</td> <td>Compute the cost of the flow given by flowDict on graph G.</td> </tr> <tr class="row-odd"><td><a class="reference internal" href="generated/networkx.algorithms.flow.max_flow_min_cost.html#networkx.algorithms.flow.max_flow_min_cost" title="networkx.algorithms.flow.max_flow_min_cost"><tt class="xref py py-obj docutils literal"><span class="pre">max_flow_min_cost</span></tt></a>(G, s, t[, capacity, weight])</td> <td>Return a maximum (s, t)-flow of minimum cost.</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.flow.max_flow.html" title="max_flow" >next</a> |</li> <li class="right" > <a href="generated/networkx.algorithms.euler.eulerian_circuit.html" title="eulerian_circuit" >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>