122 lines
4.0 KiB
C++
122 lines
4.0 KiB
C++
/*
|
|
open source routing machine
|
|
Copyright (C) Dennis Luxen, 2010
|
|
|
|
This program is free software; you can redistribute it and/or modify
|
|
it under the terms of the GNU AFFERO General Public License as published by
|
|
the Free Software Foundation; either version 3 of the License, or
|
|
any later version.
|
|
|
|
This program is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU General Public License for more details.
|
|
|
|
You should have received a copy of the GNU Affero General Public License
|
|
along with this program; if not, write to the Free Software
|
|
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
|
or see http://www.gnu.org/licenses/agpl.txt.
|
|
*/
|
|
|
|
#include "../typedefs.h"
|
|
#include "../Algorithms/StronglyConnectedComponents.h"
|
|
#include "../DataStructures/BinaryHeap.h"
|
|
#include "../DataStructures/DeallocatingVector.h"
|
|
#include "../DataStructures/DynamicGraph.h"
|
|
#include "../DataStructures/QueryEdge.h"
|
|
#include "../DataStructures/TurnInstructions.h"
|
|
#include "../Util/BaseConfiguration.h"
|
|
#include "../Util/InputFileUtil.h"
|
|
#include "../Util/GraphLoader.h"
|
|
|
|
#include <boost/foreach.hpp>
|
|
#include <fstream>
|
|
#include <istream>
|
|
#include <iostream>
|
|
#include <cstring>
|
|
#include <string>
|
|
#include <vector>
|
|
|
|
typedef QueryEdge::EdgeData EdgeData;
|
|
typedef DynamicGraph<EdgeData>::InputEdge InputEdge;
|
|
typedef BaseConfiguration ContractorConfiguration;
|
|
|
|
std::vector<NodeInfo> internal_to_external_node_map;
|
|
std::vector<_Restriction> restrictions_vector;
|
|
std::vector<NodeID> bollard_node_IDs_vector;
|
|
std::vector<NodeID> traffic_light_node_IDs_vector;
|
|
|
|
int main (int argument_count, char *argument_values[]) {
|
|
if(argument_count < 3) {
|
|
ERR("usage:\n" << argument_values[0] << " <osrm> <osrm.restrictions>");
|
|
}
|
|
|
|
INFO("Using restrictions from file: " << argument_values[2]);
|
|
std::ifstream restriction_ifstream(argument_values[2], std::ios::binary);
|
|
if(!restriction_ifstream.good()) {
|
|
ERR("Could not access <osrm-restrictions> files");
|
|
}
|
|
uint32_t usable_restriction_count = 0;
|
|
restriction_ifstream.read(
|
|
(char*)&usable_restriction_count,
|
|
sizeof(uint32_t)
|
|
);
|
|
restrictions_vector.resize(usable_restriction_count);
|
|
|
|
restriction_ifstream.read(
|
|
(char *)&(restrictions_vector[0]),
|
|
usable_restriction_count*sizeof(_Restriction)
|
|
);
|
|
restriction_ifstream.close();
|
|
|
|
std::ifstream input_stream;
|
|
input_stream.open(
|
|
argument_values[1],
|
|
std::ifstream::in | std::ifstream::binary
|
|
);
|
|
|
|
if (!input_stream.is_open()) {
|
|
ERR("Cannot open " << argument_values[1]);
|
|
}
|
|
|
|
std::vector<ImportEdge> edge_list;
|
|
NodeID node_based_node_count = readBinaryOSRMGraphFromStream(
|
|
input_stream,
|
|
edge_list,
|
|
bollard_node_IDs_vector,
|
|
traffic_light_node_IDs_vector,
|
|
&internal_to_external_node_map,
|
|
restrictions_vector
|
|
);
|
|
input_stream.close();
|
|
|
|
INFO(
|
|
restrictions_vector.size() << " restrictions, " <<
|
|
bollard_node_IDs_vector.size() << " bollard nodes, " <<
|
|
traffic_light_node_IDs_vector.size() << " traffic lights"
|
|
);
|
|
|
|
/***
|
|
* Building an edge-expanded graph from node-based input an turn restrictions
|
|
*/
|
|
|
|
INFO("Starting SCC graph traversal");
|
|
TarjanSCC * tarjan = new TarjanSCC (
|
|
node_based_node_count,
|
|
edge_list,
|
|
bollard_node_IDs_vector,
|
|
traffic_light_node_IDs_vector,
|
|
restrictions_vector,
|
|
internal_to_external_node_map
|
|
);
|
|
std::vector<ImportEdge>().swap(edge_list);
|
|
|
|
tarjan->Run();
|
|
|
|
std::vector<_Restriction>().swap(restrictions_vector);
|
|
std::vector<NodeID>().swap(bollard_node_IDs_vector);
|
|
std::vector<NodeID>().swap(traffic_light_node_IDs_vector);
|
|
INFO("finished component analysis");
|
|
return 0;
|
|
}
|