_slides: 'Wait, but is this really always true?'

_slides/image-processing/reduction-algorithms/dijkstras-optimizations.md

@@ -70,6 +70,7 @@ dijkstra(Graph graph, Vertex start, V end) {
             Vertex to = edge.to();
             if (end.equals(to)) {
                 // edgeTo stores the shortest path from start to end
+                // Wait, but is this really always true?
                 return;
             }
             double oldDist = distTo.getOrDefault(to, Double.INFINITY);