shockrah/csnotes
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

shortest path notes

Browse Source
This commit is contained in:
Medium Fries 2019-04-02 18:04:24 -07:00
parent 3d2d1a50aa
commit 8d464608aa
1 changed files with 16 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

16
370/notes/pathing.md Normal file
View File

@ -0,0 +1,16 @@
# Shortest Path
_Informed searches_ vs _uninformed searches_
# Heuristical Functions
The _good enough_ approach.
Just like traversing grids graphs need some kind of weights on them for us to use a _good enough_ algorithm.
Keep in mind that this doesn't really guarantee a _good_ solution, just one that can be determined quickly.
# Dijkstra's
Both the informed and uninformed versions work off the weights to find the shortest path.
We do this by spamming the shortest sub-routes first and adding them up, this gives back the shortest global path in the graph.