From 701e18ea36be635ee3a8a3b78cd9ffe68a1204de Mon Sep 17 00:00:00 2001 From: Matej Focko Date: Mon, 18 Mar 2024 00:22:38 +0100 Subject: [PATCH] algorithms(bf-to-astar): fix small typos Signed-off-by: Matej Focko --- algorithms/11-paths/2024-01-01-bf-to-astar/01-bf.md | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/algorithms/11-paths/2024-01-01-bf-to-astar/01-bf.md b/algorithms/11-paths/2024-01-01-bf-to-astar/01-bf.md index 9e5fb0c..a253860 100644 --- a/algorithms/11-paths/2024-01-01-bf-to-astar/01-bf.md +++ b/algorithms/11-paths/2024-01-01-bf-to-astar/01-bf.md @@ -93,7 +93,7 @@ auto bf(const graph& g, const vertex_t& source, const vertex_t& destination) :::info Relaxation I have made a brief mention of the relaxation in the comment in the code. You've -been probably thought that **relaxation of an edge** means that you found +been probably taught that **relaxation of an edge** means that you found a better solution to the problem. In general it is an approximation technique that _reduces_ the problem of @@ -129,9 +129,9 @@ Cost: 22 If you have a better look at the map, you will realize that the cost `22` is the one path skipping the `*` cells, since they cost more than going around. -We can play around a bit with it. The `*` cells can be even vortices that pull +We can play around a bit with it. The `*` cells can even be vortices that pull you in with a negative price and let you _propel_ yourself out :wink: Let's -change their cost to `-1` then. Let's check what's the fastest path to the cell. +change their cost to `-1` then and see what's the fastest path to our goal. ``` Normal cost: 1