Open-Harbor/osrm-backend
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases 3 Wiki Activity

remove unused variable

Browse Source
This commit is contained in:
Dennis Luxen 2013-12-18 12:00:35 +01:00
parent 21ff3fbccd
commit b9149658a8
1 changed files with 2 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
RoutingAlgorithms/ShortestPathRouting.h
View File

@ -29,9 +29,11 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
#define SHORTESTPATHROUTING_H_ #define SHORTESTPATHROUTING_H_
#include <boost/assert.hpp> #include <boost/assert.hpp>
#include <boost/foreach.hpp>
#include "BasicRoutingInterface.h" #include "BasicRoutingInterface.h"
#include "../DataStructures/SearchEngineData.h" #include "../DataStructures/SearchEngineData.h"
#include "../typedefs.h"
template<class DataFacadeT> template<class DataFacadeT>
class ShortestPathRouting : public BasicRoutingInterface<DataFacadeT>{ class ShortestPathRouting : public BasicRoutingInterface<DataFacadeT>{
@ -89,7 +91,6 @@ public:
QueryHeap & reverse_heap2 = *(engine_working_data.backwardHeap2); QueryHeap & reverse_heap2 = *(engine_working_data.backwardHeap2);
int current_leg = 0; int current_leg = 0;
int previous_leg = 0;
//Get distance to next pair of target nodes. //Get distance to next pair of target nodes.
BOOST_FOREACH( BOOST_FOREACH(
const PhantomNodes & phantom_node_pair, phantom_nodes_vector const PhantomNodes & phantom_node_pair, phantom_nodes_vector
@ -344,7 +345,6 @@ public:
distance1 = local_upper_bound1; distance1 = local_upper_bound1;
distance2 = local_upper_bound2; distance2 = local_upper_bound2;
previous_leg = current_leg;
++current_leg; ++current_leg;
} }
@ -361,7 +361,6 @@ public:
} }
raw_route_data.lengthOfShortestPath = std::min(distance1, distance2); raw_route_data.lengthOfShortestPath = std::min(distance1, distance2);
} }
}; };
#endif /* SHORTESTPATHROUTING_H_ */ #endif /* SHORTESTPATHROUTING_H_ */