diff --git a/be-graphes-gui/src/main/java/org/insa/graphs/gui/simple/Launch.java b/be-graphes-gui/src/main/java/org/insa/graphs/gui/simple/Launch.java
index 3ddacdb..37e12a8 100644
--- a/be-graphes-gui/src/main/java/org/insa/graphs/gui/simple/Launch.java
+++ b/be-graphes-gui/src/main/java/org/insa/graphs/gui/simple/Launch.java
@@ -9,6 +9,7 @@ import java.io.FileInputStream;
 import javax.swing.JFrame;
 import javax.swing.SwingUtilities;
 
+import org.insa.graphs.algorithm.shortestpath.BellmanFordAlgorithm;
 import org.insa.graphs.gui.drawing.Drawing;
 import org.insa.graphs.gui.drawing.components.BasicDrawing;
 import org.insa.graphs.model.Graph;
@@ -71,8 +72,9 @@ public class Launch {
         try (final PathReader pathReader = new BinaryPathReader(new DataInputStream(
             new BufferedInputStream(new FileInputStream(pathName))))) {
 
-            // TODO: read the pathxx
+            // TODO: read the path xx
             path = pathReader.readPath(graph);
+            
         }
 
         // TODO: draw the path on the drawing
diff --git a/explications.txt b/explications.txt
index 94d4661..6ea7af0 100644
--- a/explications.txt
+++ b/explications.txt
@@ -1,2 +1,4 @@
 on implémente les graphes avec des listes d'adjacences car les graphes routiers sont planaires 
 
+
+le gui graphique pour test les algos est dans MainWindows : /home/bezza/Bureau/BE-graphe/BE-Graphe/be-graphes-gui/src/main/java/org/insa/graphs/gui/MainWindow.java