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

refactor

parent 48151b87
No related branches found
No related tags found
1 merge request!1Transit algorithm implementation
......@@ -19,7 +19,7 @@
// - Reference value still valid after popping (otherwise, pop at the end, before adding new state)
TransitStateContainer TransitShortestPathPrecompute::executeAlgorithm(const Graph& graph, int nodeIndex, int instant) {
//Init container, priority queue and state variables
TransitStateContainer solutionsContainer{graph.getNodesVector().size()};
TransitStateContainer solutionsContainer{graph.getNbNodes()};
std::priority_queue<TransitAlgorithmState> statePriorityQueue;
statePriorityQueue.emplace(nodeIndex, instant,0, nodeIndex);
......
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