From 41ac66770abcee9a22226868cfc3c277efa19600 Mon Sep 17 00:00:00 2001 From: Kevin Lin Date: Mon, 13 Nov 2017 13:00:22 -0800 Subject: [PATCH] topics/graphs: A* path is S-A-E-G --- topics/graphs/shortest-paths/a-star/easy/s-a-d-g.tex | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/topics/graphs/shortest-paths/a-star/easy/s-a-d-g.tex b/topics/graphs/shortest-paths/a-star/easy/s-a-d-g.tex index 1af51da..19b96c4 100644 --- a/topics/graphs/shortest-paths/a-star/easy/s-a-d-g.tex +++ b/topics/graphs/shortest-paths/a-star/easy/s-a-d-g.tex @@ -85,7 +85,7 @@ heuristic to decide which node to visit next. \begin{solution}[1in] -$S - A - E - D - G$ +$S - A - E - G$ From the starting node, travel to the next node with the lowest value returned by the heuristic function until we reach the goal node. We choose the path with