Ask somebody to implement Dijkstra&#x27;s algorithm and they might not remember specifically <i>which</i> algorithm that was.  Questions shouldn&#x27;t say &quot;BFS&quot; or &quot;Dijkstra&quot; in them -- if you&#x27;re going to ask whiteboard questions, the way to do it is to pose a problem where that&#x27;s a solution.  Ask an actual shortest path problem or a weighted shortest path problem, or an &quot;any path in non-infinite time&quot; problem, or what-have-you.<p>BFS and Dijkstra&#x27;s aren&#x27;t really the sort of thing you implement from memory, you figure it out fresh each time, unconsciously plagiarizing from your past experiences.