From 82bb6d545827e1c703ffb8472d5d60e4017b6234 Mon Sep 17 00:00:00 2001 From: Justin Young Date: Sat, 25 May 2024 22:01:29 -0400 Subject: [PATCH] blog: update link in part 1 --- site/blog/2024-05-19-pathfiinding-part1/pathfindingpart1.md | 3 +-- 1 file changed, 1 insertion(+), 2 deletions(-) diff --git a/site/blog/2024-05-19-pathfiinding-part1/pathfindingpart1.md b/site/blog/2024-05-19-pathfiinding-part1/pathfindingpart1.md index 9c2116bd0..4b2ad9c0f 100644 --- a/site/blog/2024-05-19-pathfiinding-part1/pathfindingpart1.md +++ b/site/blog/2024-05-19-pathfiinding-part1/pathfindingpart1.md @@ -24,8 +24,7 @@ edges to form a chart. For more information on this: [click here](https://www.go For the sake of clarity, there are two algorithms we specifically dig into with this demonstration: Dijkstra's Algorithm and A\*. -COMING SOON -We study A\* more in Part 2 +We study A\* more in [Part 2](https://excaliburjs.com/blog/Pathfinding%20Algorithms%20Part%202) ## Quick History