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 9172147..792691b 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
@@ -100,7 +100,7 @@ public class DijkstraAlgorithm extends ShortestPathAlgorithm {
         // We will find the path using the parent nodes, from the destination to the origin
         Node current_node = data.getDestination();
         Label current_label = new Label(current_node);
-        System.out.println(current_node.getId());
+        // System.out.println(current_node.getId());
     
         while (current_node != null && current_node != data.getOrigin()) {
             // Find the label matching the parent node