diff options
Diffstat (limited to '_modules/networkx/algorithms/tree/coding.html')
| -rw-r--r-- | _modules/networkx/algorithms/tree/coding.html | 16 |
1 files changed, 8 insertions, 8 deletions
diff --git a/_modules/networkx/algorithms/tree/coding.html b/_modules/networkx/algorithms/tree/coding.html index 2592c833..7201bd2b 100644 --- a/_modules/networkx/algorithms/tree/coding.html +++ b/_modules/networkx/algorithms/tree/coding.html @@ -487,7 +487,7 @@ <div class="viewcode-block" id="NotATree"><a class="viewcode-back" href="../../../../reference/algorithms/generated/networkx.algorithms.tree.coding.NotATree.html#networkx.algorithms.tree.coding.NotATree">[docs]</a><span class="k">class</span> <span class="nc">NotATree</span><span class="p">(</span><span class="n">nx</span><span class="o">.</span><span class="n">NetworkXException</span><span class="p">):</span> - <span class="sd">"""Raised when a function expects a tree (that is, a connected</span> +<span class="w"> </span><span class="sd">"""Raised when a function expects a tree (that is, a connected</span> <span class="sd"> undirected graph with no cycles) but gets a non-tree graph as input</span> <span class="sd"> instead.</span> @@ -496,7 +496,7 @@ <div class="viewcode-block" id="to_nested_tuple"><a class="viewcode-back" href="../../../../reference/algorithms/generated/networkx.algorithms.tree.coding.to_nested_tuple.html#networkx.algorithms.tree.coding.to_nested_tuple">[docs]</a><span class="nd">@not_implemented_for</span><span class="p">(</span><span class="s2">"directed"</span><span class="p">)</span> <span class="k">def</span> <span class="nf">to_nested_tuple</span><span class="p">(</span><span class="n">T</span><span class="p">,</span> <span class="n">root</span><span class="p">,</span> <span class="n">canonical_form</span><span class="o">=</span><span class="kc">False</span><span class="p">):</span> - <span class="sd">"""Returns a nested tuple representation of the given tree.</span> +<span class="w"> </span><span class="sd">"""Returns a nested tuple representation of the given tree.</span> <span class="sd"> The nested tuple representation of a tree is defined</span> <span class="sd"> recursively. The tree with one node and no edges is represented by</span> @@ -562,7 +562,7 @@ <span class="sd"> """</span> <span class="k">def</span> <span class="nf">_make_tuple</span><span class="p">(</span><span class="n">T</span><span class="p">,</span> <span class="n">root</span><span class="p">,</span> <span class="n">_parent</span><span class="p">):</span> - <span class="sd">"""Recursively compute the nested tuple representation of the</span> +<span class="w"> </span><span class="sd">"""Recursively compute the nested tuple representation of the</span> <span class="sd"> given rooted tree.</span> <span class="sd"> ``_parent`` is the parent node of ``root`` in the supertree in</span> @@ -591,7 +591,7 @@ <div class="viewcode-block" id="from_nested_tuple"><a class="viewcode-back" href="../../../../reference/algorithms/generated/networkx.algorithms.tree.coding.from_nested_tuple.html#networkx.algorithms.tree.coding.from_nested_tuple">[docs]</a><span class="k">def</span> <span class="nf">from_nested_tuple</span><span class="p">(</span><span class="n">sequence</span><span class="p">,</span> <span class="n">sensible_relabeling</span><span class="o">=</span><span class="kc">False</span><span class="p">):</span> - <span class="sd">"""Returns the rooted tree corresponding to the given nested tuple.</span> +<span class="w"> </span><span class="sd">"""Returns the rooted tree corresponding to the given nested tuple.</span> <span class="sd"> The nested tuple representation of a tree is defined</span> <span class="sd"> recursively. The tree with one node and no edges is represented by</span> @@ -641,7 +641,7 @@ <span class="sd"> """</span> <span class="k">def</span> <span class="nf">_make_tree</span><span class="p">(</span><span class="n">sequence</span><span class="p">):</span> - <span class="sd">"""Recursively creates a tree from the given sequence of nested</span> +<span class="w"> </span><span class="sd">"""Recursively creates a tree from the given sequence of nested</span> <span class="sd"> tuples.</span> <span class="sd"> This function employs the :func:`~networkx.tree.join` function</span> @@ -675,7 +675,7 @@ <div class="viewcode-block" id="to_prufer_sequence"><a class="viewcode-back" href="../../../../reference/algorithms/generated/networkx.algorithms.tree.coding.to_prufer_sequence.html#networkx.algorithms.tree.coding.to_prufer_sequence">[docs]</a><span class="nd">@not_implemented_for</span><span class="p">(</span><span class="s2">"directed"</span><span class="p">)</span> <span class="k">def</span> <span class="nf">to_prufer_sequence</span><span class="p">(</span><span class="n">T</span><span class="p">):</span> - <span class="sa">r</span><span class="sd">"""Returns the Prüfer sequence of the given tree.</span> +<span class="w"> </span><span class="sa">r</span><span class="sd">"""Returns the Prüfer sequence of the given tree.</span> <span class="sd"> A *Prüfer sequence* is a list of *n* - 2 numbers between 0 and</span> <span class="sd"> *n* - 1, inclusive. The tree corresponding to a given Prüfer</span> @@ -775,7 +775,7 @@ <div class="viewcode-block" id="from_prufer_sequence"><a class="viewcode-back" href="../../../../reference/algorithms/generated/networkx.algorithms.tree.coding.from_prufer_sequence.html#networkx.algorithms.tree.coding.from_prufer_sequence">[docs]</a><span class="k">def</span> <span class="nf">from_prufer_sequence</span><span class="p">(</span><span class="n">sequence</span><span class="p">):</span> - <span class="sa">r</span><span class="sd">"""Returns the tree corresponding to the given Prüfer sequence.</span> +<span class="w"> </span><span class="sa">r</span><span class="sd">"""Returns the tree corresponding to the given Prüfer sequence.</span> <span class="sd"> A *Prüfer sequence* is a list of *n* - 2 numbers between 0 and</span> <span class="sd"> *n* - 1, inclusive. The tree corresponding to a given Prüfer</span> @@ -910,7 +910,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> |