shockrah/csnotes
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity
80eae13431
csnotes/370/notes/pathing.md
Medium Fries 8d464608aa shortest path notes
2019-04-02 18:04:24 -07:00

568 B
Raw Blame History

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.