title: Does Dijkstra's algorithm with a priority queue handle destination not found?
body: <p>I know how the algorithm works -- but it seems like it would just bounce around in a loop endlessly when using a priority queue trying to find the destination node that cannot be found.</p>
  
  <p>Does Dijkstra's algorithm handle the case where the node is disconnected from the graph?</p>