diff --git a/be-graphes-algos/src/main/java/org/insa/graphs/algorithm/shortestpath/DijkstraAlgorithm.java b/be-graphes-algos/src/main/java/org/insa/graphs/algorithm/shortestpath/DijkstraAlgorithm.java
index d676a2d..c0af685 100644
--- a/be-graphes-algos/src/main/java/org/insa/graphs/algorithm/shortestpath/DijkstraAlgorithm.java
+++ b/be-graphes-algos/src/main/java/org/insa/graphs/algorithm/shortestpath/DijkstraAlgorithm.java
@@ -55,8 +55,7 @@ public class DijkstraAlgorithm extends ShortestPathAlgorithm {
         while (!tas.isEmpty() && !(labels.get(dest_id).getNode().equals(x.getNode()))) {
             x = tas.deleteMin();
             x.mark();
-            // A marked node is considered as reached
-            notifyNodeReached(x.getNode());
+            notifyNodeMarked(x.getNode());
 
             // We create a list of node successors of x, instead of a list of Arcs.
             float arc_cost = 0;
@@ -86,6 +85,7 @@ public class DijkstraAlgorithm extends ShortestPathAlgorithm {
                         else {
                             tas.insert(successor);
                         }
+                        notifyDestinationReached(successor.getNode());
                     }
                 }
             }