Skip to content
Snippets Groups Projects
Commit f12c1ec8 authored by Romain BERNARD's avatar Romain BERNARD
Browse files

new debug instances

parent 1d10f659
No related branches found
No related tags found
1 merge request!1Transit algorithm implementation
......@@ -18,9 +18,4 @@
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
30,240,580,7,6,7,5,4,3,2,7
\ No newline at end of file
......@@ -18,9 +18,9 @@
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
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
#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,240,580,7,6,7,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
#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,3,3,3,3,3,3,3,3
15,340,560,7,7,7,7,7,7,7,7
30,360,580,2,3,4,5,6,7
\ No newline at end of file
......@@ -25,20 +25,30 @@ int main() {
}
}
Graph cyclingLinesGraph("../resources/test/instances/cycling_line_debug_instance/" + datFile);
for(auto& ptLine : cyclingLinesGraph.getPTLines()) {
Graph crossingLinesGraph("../resources/test/instances/multiple_crossing_lines_debug_instance/" + datFile);
for(auto& ptLine : crossingLinesGraph.getPTLines()) {
for(int i = 0; i < ptLine.size(); ++i) {
for (auto& startingTime: ptLine.getTimetable(i)) {
TransitShortestPathPrecompute::executeAlgorithm(cyclingLinesGraph, ptLine.getNode(i),startingTime);
TransitShortestPathPrecompute::executeAlgorithm(crossingLinesGraph, ptLine.getNode(i),startingTime);
}
}
}
Graph crossingLinesGraph("../resources/test/instances/multiple_crossing_lines_debug_instance/" + datFile);
for(auto& ptLine : crossingLinesGraph.getPTLines()) {
Graph cyclingLineGraph("../resources/test/instances/cycling_line_debug_instance/" + datFile);
for(auto& ptLine : cyclingLineGraph.getPTLines()) {
for(int i = 0; i < ptLine.size(); ++i) {
for (auto& startingTime: ptLine.getTimetable(i)) {
TransitShortestPathPrecompute::executeAlgorithm(crossingLinesGraph, ptLine.getNode(i),startingTime);
TransitShortestPathPrecompute::executeAlgorithm(cyclingLineGraph, ptLine.getNode(i),startingTime);
}
}
}
Graph multipleCyclingLinesGraph("../resources/test/instances/multiple_cycling_lines_debug_instance/" + datFile);
for(auto& ptLine : multipleCyclingLinesGraph.getPTLines()) {
for(int i = 0; i < ptLine.size(); ++i) {
for (auto& startingTime: ptLine.getTimetable(i)) {
TransitShortestPathPrecompute::executeAlgorithm(multipleCyclingLinesGraph, ptLine.getNode(i),startingTime);
}
}
}
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment