diff options
Diffstat (limited to '_modules/networkx/algorithms/chains.html')
| -rw-r--r-- | _modules/networkx/algorithms/chains.html | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/_modules/networkx/algorithms/chains.html b/_modules/networkx/algorithms/chains.html index 0cc9c910..29396974 100644 --- a/_modules/networkx/algorithms/chains.html +++ b/_modules/networkx/algorithms/chains.html @@ -472,7 +472,7 @@ <div class="viewcode-block" id="chain_decomposition"><a class="viewcode-back" href="../../../reference/algorithms/generated/networkx.algorithms.chains.chain_decomposition.html#networkx.algorithms.chains.chain_decomposition">[docs]</a><span class="nd">@not_implemented_for</span><span class="p">(</span><span class="s2">"directed"</span><span class="p">)</span> <span class="nd">@not_implemented_for</span><span class="p">(</span><span class="s2">"multigraph"</span><span class="p">)</span> <span class="k">def</span> <span class="nf">chain_decomposition</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">root</span><span class="o">=</span><span class="kc">None</span><span class="p">):</span> - <span class="sd">"""Returns the chain decomposition of a graph.</span> +<span class="w"> </span><span class="sd">"""Returns the chain decomposition of a graph.</span> <span class="sd"> The *chain decomposition* of a graph with respect a depth-first</span> <span class="sd"> search tree is a set of cycles or paths derived from the set of</span> @@ -527,7 +527,7 @@ <span class="sd"> """</span> <span class="k">def</span> <span class="nf">_dfs_cycle_forest</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">root</span><span class="o">=</span><span class="kc">None</span><span class="p">):</span> - <span class="sd">"""Builds a directed graph composed of cycles from the given graph.</span> +<span class="w"> </span><span class="sd">"""Builds a directed graph composed of cycles from the given graph.</span> <span class="sd"> `G` is an undirected simple graph. `root` is a node in the graph</span> <span class="sd"> from which the depth-first search is started.</span> @@ -583,7 +583,7 @@ <span class="k">return</span> <span class="n">H</span><span class="p">,</span> <span class="n">nodes</span> <span class="k">def</span> <span class="nf">_build_chain</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">u</span><span class="p">,</span> <span class="n">v</span><span class="p">,</span> <span class="n">visited</span><span class="p">):</span> - <span class="sd">"""Generate the chain starting from the given nontree edge.</span> +<span class="w"> </span><span class="sd">"""Generate the chain starting from the given nontree edge.</span> <span class="sd"> `G` is a DFS cycle graph as constructed by</span> <span class="sd"> :func:`_dfs_cycle_graph`. The edge (`u`, `v`) is a nontree edge</span> @@ -683,7 +683,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> |