diff --git a/resources/test/instances/cycling_line_debug_instance/graph.dat b/resources/test/instances/cycling_line_debug_instance/graph.dat
new file mode 100644
index 0000000000000000000000000000000000000000..4cdc53d46a0ce446b94b1fc38095bc17da27a63f
--- /dev/null
+++ b/resources/test/instances/cycling_line_debug_instance/graph.dat
@@ -0,0 +1,26 @@
+#Params (seed)
+123456789
+#Nodes format : status,x,y
+,0,7
+,1,6
+,2,5
+,3,4
+,4,3
+,5,2
+,6,1
+,7,0
+#Edges format : node_in,node_out,length
+0,1,1
+1,2,1
+2,3,2
+2,4,4
+4,5,2
+5,6,3
+6,7,2
+#PT line format : freq (min), start_time, end_time, node_1, ..., node_n
+15,340,560,3,4,5,6
+15,340,560,6,5,4,3
+30,360,580,2,3,4,5,6,7
+30,240,580,7,6,5,4,3,2
+30,290,580,0,4,1
+30,290,580,1,4,0
\ No newline at end of file
diff --git a/resources/test/instances/multiple_crossing_lines_debug_instance/graph.dat b/resources/test/instances/multiple_crossing_lines_debug_instance/graph.dat
new file mode 100644
index 0000000000000000000000000000000000000000..c12d94a45bd4f63af8380d65c34451e074e13bb1
--- /dev/null
+++ b/resources/test/instances/multiple_crossing_lines_debug_instance/graph.dat
@@ -0,0 +1,26 @@
+#Params (seed)
+123456789
+#Nodes format : status,x,y
+,0,7
+,1,6
+,2,5
+,3,4
+,4,3
+,5,2
+,6,1
+,7,0
+#Edges format : node_in,node_out,length
+0,1,1
+1,2,1
+2,3,2
+2,4,4
+4,5,2
+5,6,3
+6,7,2
+#PT line format : freq (min), start_time, end_time, node_1, ..., node_n
+15,340,560,3,4,5,6,3
+15,340,560,6,5,4,3,6
+30,360,580,2,3,4,5,6,7,2
+30,240,580,7,6,5,4,3,2,7
+30,290,580,0,4,1,0
+30,290,580,1,4,0,1
\ No newline at end of file
diff --git a/test/debug.cpp b/test/debug.cpp
index dfc3ba10be74b155f22633dd655e5a6612099706..cee738d76302683c6396ddac1c5e09f373511c85 100644
--- a/test/debug.cpp
+++ b/test/debug.cpp
@@ -24,5 +24,24 @@ int main() {
             }
         }
     }
+
+    Graph cyclingLinesGraph("../resources/test/instances/cycling_line_debug_instance" + datFile);
+    for(auto& ptLine : cyclingLinesGraph.getPTLines()) {
+        for(int i = 0; i < ptLine.size(); ++i) {
+            for (auto& startingTime: ptLine.getTimetable(i)) {
+                TransitShortestPathPrecompute::executeAlgorithm(cyclingLinesGraph, ptLine.getNode(i),startingTime);
+            }
+        }
+    }
+
+    Graph crossingLinesGraph("../resources/test/instances/multiple_crossing_line_debug_instance" + datFile);
+    for(auto& ptLine : crossingLinesGraph.getPTLines()) {
+        for(int i = 0; i < ptLine.size(); ++i) {
+            for (auto& startingTime: ptLine.getTimetable(i)) {
+                TransitShortestPathPrecompute::executeAlgorithm(crossingLinesGraph, ptLine.getNode(i),startingTime);
+            }
+        }
+    }
+
     return 0;
 }
\ No newline at end of file