pathfinding part 1 #3069
Merged
pathfinding part 1 #3069
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Deploying excaliburjs with
|
| Latest commit: |
32ddae6
|
| Status: | ✅ Deploy successful! |
| Preview URL: | https://e2fb3d18.excaliburjs.pages.dev |
| Branch Preview URL: | https://pathfindingblog.excaliburjs.pages.dev |
eonarheim
reviewed
May 19, 2024
|
|
||
| ### Dijkstra's Algorithm | ||
|
|
||
| Dijkstra's Algorithm is an algorithm for finding the shortest path through a graph that presents weighting (distances) between |
There was a problem hiding this comment.
Small nit, algorithm is used twice in the sentence
eonarheim
reviewed
May 19, 2024
|
|
||
|  | ||
|
|
||
| Edsger Dijkstra, in Amsterdam, was sipping coffee at a cafe in Amserdam in 1956, and was working through a mental exercise regarding |
There was a problem hiding this comment.
Small nit, Amsterdam is used twice in the sentence
eonarheim
reviewed
May 19, 2024
| Let's declare A our starting node and update our results object with this current information. Since we are starting at node A, we then | ||
| review A's connected neighbors, in this example its nodes B and C. | ||
|
|
||
|  |
eonarheim
reviewed
May 19, 2024
|
|
||
| With that update, we can move node A from unvisited to visited list, and we have this new state. | ||
|
|
||
|  |
eonarheim
reviewed
May 19, 2024
|
|
||
| We continue to repeat this algorithm until we have visited all nodes. | ||
|
|
||
| Quick iteration: |
There was a problem hiding this comment.
Not sure what Quick Iteration means
eonarheim
reviewed
May 19, 2024
| In this article, we reviewed a brief history of Dijkstra's Algorithm, then we created and example graph network and stepped through it | ||
| using the algorithm, and then was able to use it to determine the shortest path of nodes. | ||
|
|
||
| This algorithm I have found is more expensive than A\*, but is a nice tool to use when you don't understand the shape and size of the |
There was a problem hiding this comment.
It might be nice to have this benefit at the beginning of the article as well
There was a problem hiding this comment.
this is the only one that i waffled on regarding making a change...
eonarheim
reviewed
May 19, 2024
| sometimes, I need just to understand if that path is clear between one tile and another. Sometimes you can have a graph node tree, and | ||
| need to understand the cheapest decision. These are the kinds of challenges where one could use a pathfinding algorithm to solve. | ||
|
|
||
|  |
eonarheim
reviewed
May 19, 2024
|
|
||
| Node B is closer to Source than node D, so we visit it next. | ||
|
|
||
|  |
eonarheim
reviewed
May 19, 2024
|
|
||
| D is the only unvisited neighbor, and we hit a dead end on this branch, so D gets visited, but with no updates to the results table | ||
|
|
||
|  |
eonarheim
approved these changes
May 20, 2024
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
blog entry for pathfinding part 1