From 8d464608aab9c24b2e8be21fc696511a2917bada Mon Sep 17 00:00:00 2001 From: Medium Fries Date: Tue, 2 Apr 2019 18:04:24 -0700 Subject: [PATCH] shortest path notes --- 370/notes/pathing.md | 16 ++++++++++++++++ 1 file changed, 16 insertions(+) create mode 100644 370/notes/pathing.md diff --git a/370/notes/pathing.md b/370/notes/pathing.md new file mode 100644 index 0000000..2e2d2af --- /dev/null +++ b/370/notes/pathing.md @@ -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. +