diff options
Diffstat (limited to '_modules/networkx/algorithms/shortest_paths/astar.html')
| -rw-r--r-- | _modules/networkx/algorithms/shortest_paths/astar.html | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/_modules/networkx/algorithms/shortest_paths/astar.html b/_modules/networkx/algorithms/shortest_paths/astar.html index 7179d006..3bf7bd4d 100644 --- a/_modules/networkx/algorithms/shortest_paths/astar.html +++ b/_modules/networkx/algorithms/shortest_paths/astar.html @@ -473,7 +473,7 @@ <div class="viewcode-block" id="astar_path"><a class="viewcode-back" href="../../../../reference/algorithms/generated/networkx.algorithms.shortest_paths.astar.astar_path.html#networkx.algorithms.shortest_paths.astar.astar_path">[docs]</a><span class="k">def</span> <span class="nf">astar_path</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">target</span><span class="p">,</span> <span class="n">heuristic</span><span class="o">=</span><span class="kc">None</span><span class="p">,</span> <span class="n">weight</span><span class="o">=</span><span class="s2">"weight"</span><span class="p">):</span> - <span class="sd">"""Returns a list of nodes in a shortest path between source and target</span> +<span class="w"> </span><span class="sd">"""Returns a list of nodes in a shortest path between source and target</span> <span class="sd"> using the A* ("A-star") algorithm.</span> <span class="sd"> There may be more than one shortest path. This returns only one.</span> @@ -619,7 +619,7 @@ <div class="viewcode-block" id="astar_path_length"><a class="viewcode-back" href="../../../../reference/algorithms/generated/networkx.algorithms.shortest_paths.astar.astar_path_length.html#networkx.algorithms.shortest_paths.astar.astar_path_length">[docs]</a><span class="k">def</span> <span class="nf">astar_path_length</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">target</span><span class="p">,</span> <span class="n">heuristic</span><span class="o">=</span><span class="kc">None</span><span class="p">,</span> <span class="n">weight</span><span class="o">=</span><span class="s2">"weight"</span><span class="p">):</span> - <span class="sd">"""Returns the length of the shortest path between source and target using</span> +<span class="w"> </span><span class="sd">"""Returns the length of the shortest path between source and target using</span> <span class="sd"> the A* ("A-star") algorithm.</span> <span class="sd"> Parameters</span> @@ -722,7 +722,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> |