We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 32b9658 commit 41ac667Copy full SHA for 41ac667
topics/graphs/shortest-paths/a-star/easy/s-a-d-g.tex
@@ -85,7 +85,7 @@
85
heuristic to decide which node to visit next.
86
87
\begin{solution}[1in]
88
-$S - A - E - D - G$
+$S - A - E - G$
89
90
From the starting node, travel to the next node with the lowest value returned
91
by the heuristic function until we reach the goal node. We choose the path with
0 commit comments