diff --git a/graph-search/notes.md b/graph-search/notes.md
index b38c3eb7763fc8679271f26c1af62b95d11f6fad..2edfaca8f846eea43bd0734a83756b1f02849e5d 100644
--- a/graph-search/notes.md
+++ b/graph-search/notes.md
@@ -2,7 +2,7 @@ If you wish to follow along on your own laptop, please clone the starter code li
 
 # Problem 1:
 
-In the weighted directed graph on the whiteboard, what is the shortest path from `a` to `d`?
+In the weighted directed graph to the right, what is the shortest path from `a` to `d`?
 
 # Problem 2: