diff --git a/graph-search/notes.md b/graph-search/notes.md index b148906f88ceed4e518510bebd3a95b1261caca9..f829fc6552eb639574f7210dfd5418ca7aa28892 100644 --- a/graph-search/notes.md +++ b/graph-search/notes.md @@ -2,6 +2,10 @@ Please clone the starter code linked from Canvas (with `git clone --recursive` s # Problem 1: +In the weighted directed graph to the right, what is the shortest path from `a` to `d`? + +# Problem 2: + For a certain puzzle played on a string of digits, each move may slide any digit `x` left `x` places or right `x` places, as long as there is room. For example, the `4` in `123456789` can move right four spots: > 123456789 @@ -18,10 +22,6 @@ but it cannot move left, because trying would move it past the end of the string How many moves does it take to reverse the string `123`? -# Problem 2: - -In the weighted directed graph on the whiteboard, what is the shortest path from `a` to `d`? - --------------------------------------------------------------------- # Worklist Algorithms for Graph Search @@ -34,7 +34,7 @@ In the weighted directed graph on the whiteboard, what is the shortest path from * Worklist: … * Guaranteed to find a path if one exists * Not guaranteed to find a good path -* Can be made very memory efficient (topic for Thursday) +* Can be made very memory efficient (topic for a later class) Worklist Backpointers -------- ------------