diff options
Diffstat (limited to '_modules/networkx/algorithms/traversal/beamsearch.html')
| -rw-r--r-- | _modules/networkx/algorithms/traversal/beamsearch.html | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/_modules/networkx/algorithms/traversal/beamsearch.html b/_modules/networkx/algorithms/traversal/beamsearch.html index 63c1ef6f..e8c9dd3d 100644 --- a/_modules/networkx/algorithms/traversal/beamsearch.html +++ b/_modules/networkx/algorithms/traversal/beamsearch.html @@ -469,7 +469,7 @@ <div class="viewcode-block" id="bfs_beam_edges"><a class="viewcode-back" href="../../../../reference/algorithms/generated/networkx.algorithms.traversal.beamsearch.bfs_beam_edges.html#networkx.algorithms.traversal.beamsearch.bfs_beam_edges">[docs]</a><span class="k">def</span> <span class="nf">bfs_beam_edges</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">source</span><span class="p">,</span> <span class="n">value</span><span class="p">,</span> <span class="n">width</span><span class="o">=</span><span class="kc">None</span><span class="p">):</span> - <span class="sd">"""Iterates over edges in a beam search.</span> +<span class="w"> </span><span class="sd">"""Iterates over edges in a beam search.</span> <span class="sd"> The beam search is a generalized breadth-first search in which only</span> <span class="sd"> the "best" *w* neighbors of the current node are enqueued, where *w*</span> @@ -539,7 +539,7 @@ <span class="n">width</span> <span class="o">=</span> <span class="nb">len</span><span class="p">(</span><span class="n">G</span><span class="p">)</span> <span class="k">def</span> <span class="nf">successors</span><span class="p">(</span><span class="n">v</span><span class="p">):</span> - <span class="sd">"""Returns a list of the best neighbors of a node.</span> +<span class="w"> </span><span class="sd">"""Returns a list of the best neighbors of a node.</span> <span class="sd"> `v` is a node in the graph `G`.</span> @@ -616,7 +616,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> |