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

extractLargeNetwork has fault-tolerance now.

Browse Source 
extractNetwork has been deprecated.
This commit is contained in:
Dennis Luxen 2010-08-06 15:30:00 +00:00
parent 048c04d0f1
commit ae0e6d6516
3 changed files with 464 additions and 608 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

516
DataStructures/extractorStructs.h
View File

@ -43,288 +43,304 @@ string names[13] = { "motorway", "motorway_link", "trunk", "trunk_link", "primar
double speeds[13] = { 110, 90, 90, 70, 70, 60, 60, 50, 55, 50, 40 , 10, 30}; double speeds[13] = { 110, 90, 90, 70, 70, 60, 60, 50, 55, 50, 40 , 10, 30};
struct _Node : NodeInfo{ struct _Node : NodeInfo{
bool trafficSignal; bool trafficSignal;
_Node(int _lat, int _lon, unsigned int _id) : NodeInfo(_lat, _lon, _id) {} _Node(int _lat, int _lon, unsigned int _id) : NodeInfo(_lat, _lon, _id) {}
_Node() {} _Node() {}
static _Node min_value() static _Node min_value()
{ {
return _Node(0,0,0); return _Node(0,0,0);
} }
static _Node max_value() static _Node max_value()
{ {
return _Node(numeric_limits<int>::max(), numeric_limits<int>::max(), numeric_limits<unsigned int>::max()); return _Node(numeric_limits<int>::max(), numeric_limits<int>::max(), numeric_limits<unsigned int>::max());
} }
NodeID key() const NodeID key() const
{ {
return id; return id;
} }
}; };
struct _Way { struct _Way {
std::vector< NodeID > path; std::vector< NodeID > path;
enum { enum {
notSure = 0, oneway, bidirectional, opposite notSure = 0, oneway, bidirectional, opposite
} direction; } direction;
double maximumSpeed; double maximumSpeed;
bool usefull:1; bool usefull:1;
bool access:1; bool access:1;
short type; short type;
}; };
struct _Stats { struct _Edge {
NodeID numberOfNodes; NodeID start;
NodeID numberOfEdges; NodeID target;
NodeID numberOfWays; short type;
NodeID numberOfMaxspeed; short direction;
double speed;
}; };
struct Settings { struct Settings {
struct SpeedProfile { struct SpeedProfile {
vector< double > speed; vector< double > speed;
vector< string > names; vector< string > names;
} speedProfile; } speedProfile;
vector<string> accessList; vector<string> accessList;
int trafficLightPenalty; int trafficLightPenalty;
int indexInAccessListOf( const string & key) int indexInAccessListOf( const string & key)
{ {
for(int i = 0; i< accessList.size(); i++) for(int i = 0; i< accessList.size(); i++)
{ {
if(accessList[i] == key) if(accessList[i] == key)
return i; return i;
} }
return -1; return -1;
} }
}; };
struct Cmp : public std::binary_function<NodeID, NodeID, bool> struct Cmp : public std::binary_function<NodeID, NodeID, bool>
{ {
typedef unsigned value_type; typedef unsigned value_type;
bool operator () (const NodeID & a, const NodeID & b) const bool operator () (const NodeID & a, const NodeID & b) const
{ {
return a < b; return a < b;
} }
value_type max_value() value_type max_value()
{ {
return 0xffffffff; return 0xffffffff;
} }
value_type min_value() value_type min_value()
{ {
return 0x0; return 0x0;
} }
}; };
_Way _ReadXMLWay( xmlTextReaderPtr& inputReader, Settings& settings, _Stats& stats ) { _Way _ReadXMLWay( xmlTextReaderPtr& inputReader, Settings& settings ) {
_Way way; _Way way;
way.direction = _Way::notSure; way.direction = _Way::notSure;
way.maximumSpeed = -1; way.maximumSpeed = -1;
way.type = -1; way.type = -1;
way.usefull = false; way.usefull = false;
way.access = true; way.access = true;
if ( xmlTextReaderIsEmptyElement( inputReader ) != 1 ) { if ( xmlTextReaderIsEmptyElement( inputReader ) != 1 ) {
const int depth = xmlTextReaderDepth( inputReader ); const int depth = xmlTextReaderDepth( inputReader );
while ( xmlTextReaderRead( inputReader ) == 1 ) { while ( xmlTextReaderRead( inputReader ) == 1 ) {
const int childType = xmlTextReaderNodeType( inputReader ); const int childType = xmlTextReaderNodeType( inputReader );
if ( childType != 1 && childType != 15 ) if ( childType != 1 && childType != 15 )
continue; continue;
const int childDepth = xmlTextReaderDepth( inputReader ); const int childDepth = xmlTextReaderDepth( inputReader );
xmlChar* childName = xmlTextReaderName( inputReader ); xmlChar* childName = xmlTextReaderName( inputReader );
if ( childName == NULL ) if ( childName == NULL )
continue; continue;
if ( depth == childDepth && childType == 15 && xmlStrEqual( childName, ( const xmlChar* ) "way" ) == 1 ) { if ( depth == childDepth && childType == 15 && xmlStrEqual( childName, ( const xmlChar* ) "way" ) == 1 ) {
xmlFree( childName ); xmlFree( childName );
break; break;
} }
if ( childType != 1 ) { if ( childType != 1 ) {
xmlFree( childName ); xmlFree( childName );
continue; continue;
} }
if ( xmlStrEqual( childName, ( const xmlChar* ) "tag" ) == 1 ) { if ( xmlStrEqual( childName, ( const xmlChar* ) "tag" ) == 1 ) {
xmlChar* k = xmlTextReaderGetAttribute( inputReader, ( const xmlChar* ) "k" ); xmlChar* k = xmlTextReaderGetAttribute( inputReader, ( const xmlChar* ) "k" );
xmlChar* value = xmlTextReaderGetAttribute( inputReader, ( const xmlChar* ) "v" ); xmlChar* value = xmlTextReaderGetAttribute( inputReader, ( const xmlChar* ) "v" );
if ( k != NULL && value != NULL ) { if ( k != NULL && value != NULL ) {
if ( xmlStrEqual( k, ( const xmlChar* ) "oneway" ) == 1 ) { if ( xmlStrEqual( k, ( const xmlChar* ) "oneway" ) == 1 ) {
if ( xmlStrEqual( value, ( const xmlChar* ) "no" ) == 1 || xmlStrEqual( value, ( const xmlChar* ) "false" ) == 1 || xmlStrEqual( value, ( const xmlChar* ) "0" ) == 1 ) if ( xmlStrEqual( value, ( const xmlChar* ) "no" ) == 1 || xmlStrEqual( value, ( const xmlChar* ) "false" ) == 1 || xmlStrEqual( value, ( const xmlChar* ) "0" ) == 1 )
way.direction = _Way::bidirectional; way.direction = _Way::bidirectional;
else if ( xmlStrEqual( value, ( const xmlChar* ) "yes" ) == 1 || xmlStrEqual( value, ( const xmlChar* ) "true" ) == 1 || xmlStrEqual( value, ( const xmlChar* ) "1" ) == 1 ) else if ( xmlStrEqual( value, ( const xmlChar* ) "yes" ) == 1 || xmlStrEqual( value, ( const xmlChar* ) "true" ) == 1 || xmlStrEqual( value, ( const xmlChar* ) "1" ) == 1 )
way.direction = _Way::oneway; way.direction = _Way::oneway;
else if ( xmlStrEqual( value, ( const xmlChar* ) "-1" ) == 1 ) else if ( xmlStrEqual( value, ( const xmlChar* ) "-1" ) == 1 )
way.direction = _Way::opposite; way.direction = _Way::opposite;
} else if ( xmlStrEqual( k, ( const xmlChar* ) "junction" ) == 1 ) { } else if ( xmlStrEqual( k, ( const xmlChar* ) "junction" ) == 1 ) {
if ( xmlStrEqual( value, ( const xmlChar* ) "roundabout" ) == 1 ) { if ( xmlStrEqual( value, ( const xmlChar* ) "roundabout" ) == 1 ) {
if ( way.direction == _Way::notSure ) { if ( way.direction == _Way::notSure ) {
way.direction = _Way::oneway; way.direction = _Way::oneway;
} }
if ( way.maximumSpeed == -1 ) if ( way.maximumSpeed == -1 )
way.maximumSpeed = 10; way.maximumSpeed = 10;
way.usefull = true; way.usefull = true;
} }
} else if ( xmlStrEqual( k, ( const xmlChar* ) "highway" ) == 1 ) { } else if ( xmlStrEqual( k, ( const xmlChar* ) "highway" ) == 1 ) {
string name( ( const char* ) value ); string name( ( const char* ) value );
for ( int i = 0; i < settings.speedProfile.names.size(); i++ ) { for ( int i = 0; i < settings.speedProfile.names.size(); i++ ) {
if ( name == settings.speedProfile.names[i] ) { if ( name == settings.speedProfile.names[i] ) {
way.type = i; way.type = i;
way.usefull = true; way.usefull = true;
break; break;
} }
} }
if ( name == "motorway" ) { if ( name == "motorway" ) {
if ( way.direction == _Way::notSure ) { if ( way.direction == _Way::notSure ) {
way.direction = _Way::oneway; way.direction = _Way::oneway;
} }
} else if ( name == "motorway_link" ) { } else if ( name == "motorway_link" ) {
if ( way.direction == _Way::notSure ) { if ( way.direction == _Way::notSure ) {
way.direction = _Way::oneway; way.direction = _Way::oneway;
} }
} }
} else if ( xmlStrEqual( k, ( const xmlChar* ) "maxspeed" ) == 1 ) { } else if ( xmlStrEqual( k, ( const xmlChar* ) "maxspeed" ) == 1 ) {
double maxspeed = atof(( const char* ) value ); double maxspeed = atof(( const char* ) value );
xmlChar buffer[100]; xmlChar buffer[100];
xmlStrPrintf( buffer, 100, ( const xmlChar* ) "%.lf", maxspeed ); xmlStrPrintf( buffer, 100, ( const xmlChar* ) "%.lf", maxspeed );
if ( xmlStrEqual( value, buffer ) == 1 ) { if ( xmlStrEqual( value, buffer ) == 1 ) {
way.maximumSpeed = maxspeed; way.maximumSpeed = maxspeed;
stats.numberOfMaxspeed++; } else {
} else { xmlStrPrintf( buffer, 100, ( const xmlChar* ) "%.lf kmh", maxspeed );
xmlStrPrintf( buffer, 100, ( const xmlChar* ) "%.lf kmh", maxspeed ); if ( xmlStrEqual( value, buffer ) == 1 ) {
if ( xmlStrEqual( value, buffer ) == 1 ) { way.maximumSpeed = maxspeed;
way.maximumSpeed = maxspeed; } else {
stats.numberOfMaxspeed++; xmlStrPrintf( buffer, 100, ( const xmlChar* ) "%.lfkmh", maxspeed );
} else { if ( xmlStrEqual( value, buffer ) == 1 ) {
xmlStrPrintf( buffer, 100, ( const xmlChar* ) "%.lfkmh", maxspeed ); way.maximumSpeed = maxspeed;
if ( xmlStrEqual( value, buffer ) == 1 ) { } else {
way.maximumSpeed = maxspeed; xmlStrPrintf( buffer, 100, ( const xmlChar* ) "%.lf km/h", maxspeed );
stats.numberOfMaxspeed++; if ( xmlStrEqual( value, buffer ) == 1 ) {
} else { way.maximumSpeed = maxspeed;
xmlStrPrintf( buffer, 100, ( const xmlChar* ) "%.lf km/h", maxspeed ); } else {
if ( xmlStrEqual( value, buffer ) == 1 ) { xmlStrPrintf( buffer, 100, ( const xmlChar* ) "%.lfkm/h", maxspeed );
way.maximumSpeed = maxspeed; if ( xmlStrEqual( value, buffer ) == 1 ) {
stats.numberOfMaxspeed++; way.maximumSpeed = maxspeed;
} else { } else {
xmlStrPrintf( buffer, 100, ( const xmlChar* ) "%.lfkm/h", maxspeed ); xmlStrPrintf( buffer, 100, ( const xmlChar* ) "%.lf mph", maxspeed );
if ( xmlStrEqual( value, buffer ) == 1 ) { if ( xmlStrEqual( value, buffer ) == 1 ) {
way.maximumSpeed = maxspeed; way.maximumSpeed = maxspeed;
stats.numberOfMaxspeed++; } else {
} xmlStrPrintf( buffer, 100, ( const xmlChar* ) "%.lfmph", maxspeed );
} if ( xmlStrEqual( value, buffer ) == 1 ) {
} way.maximumSpeed = maxspeed;
} } else {
} xmlStrPrintf( buffer, 100, ( const xmlChar* ) "%.lf mp/h", maxspeed );
} else { if ( xmlStrEqual( value, buffer ) == 1 ) {
if ( xmlStrEqual( value, ( const xmlChar* ) "private" ) == 1 way.maximumSpeed = maxspeed;
|| xmlStrEqual( value, ( const xmlChar* ) "no" ) == 1 } else {
|| xmlStrEqual( value, ( const xmlChar* ) "agricultural" ) == 1 xmlStrPrintf( buffer, 100, ( const xmlChar* ) "%.lfmp/h", maxspeed );
|| xmlStrEqual( value, ( const xmlChar* ) "forestry" ) == 1 if ( xmlStrEqual( value, buffer ) == 1 ) {
|| xmlStrEqual( value, ( const xmlChar* ) "delivery" ) == 1 way.maximumSpeed = maxspeed;
) { }
way.access = false; }
} }
else if ( xmlStrEqual( value, ( const xmlChar* ) "yes" ) == 1 }
|| xmlStrEqual( value, ( const xmlChar* ) "designated" ) == 1 }
|| xmlStrEqual( value, ( const xmlChar* ) "official" ) == 1 }
|| xmlStrEqual( value, ( const xmlChar* ) "permissive" ) == 1 }
) { }
way.access = true; }
} } else {
} if ( xmlStrEqual( value, ( const xmlChar* ) "private" ) == 1
|| xmlStrEqual( value, ( const xmlChar* ) "no" ) == 1
|| xmlStrEqual( value, ( const xmlChar* ) "agricultural" ) == 1
|| xmlStrEqual( value, ( const xmlChar* ) "forestry" ) == 1
|| xmlStrEqual( value, ( const xmlChar* ) "delivery" ) == 1
) {
way.access = false;
}
else if ( xmlStrEqual( value, ( const xmlChar* ) "yes" ) == 1
|| xmlStrEqual( value, ( const xmlChar* ) "designated" ) == 1
|| xmlStrEqual( value, ( const xmlChar* ) "official" ) == 1
|| xmlStrEqual( value, ( const xmlChar* ) "permissive" ) == 1
) {
way.access = true;
}
}
if ( k != NULL ) if ( k != NULL )
xmlFree( k ); xmlFree( k );
if ( value != NULL ) if ( value != NULL )
xmlFree( value ); xmlFree( value );
} }
} else if ( xmlStrEqual( childName, ( const xmlChar* ) "nd" ) == 1 ) { } else if ( xmlStrEqual( childName, ( const xmlChar* ) "nd" ) == 1 ) {
xmlChar* ref = xmlTextReaderGetAttribute( inputReader, ( const xmlChar* ) "ref" ); xmlChar* ref = xmlTextReaderGetAttribute( inputReader, ( const xmlChar* ) "ref" );
if ( ref != NULL ) { if ( ref != NULL ) {
way.path.push_back( atoi(( const char* ) ref ) ); way.path.push_back( atoi(( const char* ) ref ) );
xmlFree( ref ); xmlFree( ref );
} }
} }
xmlFree( childName ); xmlFree( childName );
} }
} }
return way; return way;
} }
_Node _ReadXMLNode( xmlTextReaderPtr& inputReader ) { _Node _ReadXMLNode( xmlTextReaderPtr& inputReader ) {
_Node node; _Node node;
node.trafficSignal = false; node.trafficSignal = false;
xmlChar* attribute = xmlTextReaderGetAttribute( inputReader, ( const xmlChar* ) "lat" ); xmlChar* attribute = xmlTextReaderGetAttribute( inputReader, ( const xmlChar* ) "lat" );
if ( attribute != NULL ) { if ( attribute != NULL ) {
node.lat = static_cast<NodeID>(100000*atof(( const char* ) attribute ) ); node.lat = static_cast<NodeID>(100000*atof(( const char* ) attribute ) );
xmlFree( attribute ); xmlFree( attribute );
} }
attribute = xmlTextReaderGetAttribute( inputReader, ( const xmlChar* ) "lon" ); attribute = xmlTextReaderGetAttribute( inputReader, ( const xmlChar* ) "lon" );
if ( attribute != NULL ) { if ( attribute != NULL ) {
node.lon = static_cast<NodeID>(100000*atof(( const char* ) attribute )); node.lon = static_cast<NodeID>(100000*atof(( const char* ) attribute ));
xmlFree( attribute ); xmlFree( attribute );
} }
attribute = xmlTextReaderGetAttribute( inputReader, ( const xmlChar* ) "id" ); attribute = xmlTextReaderGetAttribute( inputReader, ( const xmlChar* ) "id" );
if ( attribute != NULL ) { if ( attribute != NULL ) {
node.id = atoi(( const char* ) attribute ); node.id = atoi(( const char* ) attribute );
xmlFree( attribute ); xmlFree( attribute );
} }
if ( xmlTextReaderIsEmptyElement( inputReader ) != 1 ) { if ( xmlTextReaderIsEmptyElement( inputReader ) != 1 ) {
const int depth = xmlTextReaderDepth( inputReader ); const int depth = xmlTextReaderDepth( inputReader );
while ( xmlTextReaderRead( inputReader ) == 1 ) { while ( xmlTextReaderRead( inputReader ) == 1 ) {
const int childType = xmlTextReaderNodeType( inputReader ); const int childType = xmlTextReaderNodeType( inputReader );
// 1 = Element, 15 = EndElement // 1 = Element, 15 = EndElement
if ( childType != 1 && childType != 15 ) if ( childType != 1 && childType != 15 )
continue; continue;
const int childDepth = xmlTextReaderDepth( inputReader ); const int childDepth = xmlTextReaderDepth( inputReader );
xmlChar* childName = xmlTextReaderName( inputReader ); xmlChar* childName = xmlTextReaderName( inputReader );
if ( childName == NULL ) if ( childName == NULL )
continue; continue;
if ( depth == childDepth && childType == 15 && xmlStrEqual( childName, ( const xmlChar* ) "node" ) == 1 ) { if ( depth == childDepth && childType == 15 && xmlStrEqual( childName, ( const xmlChar* ) "node" ) == 1 ) {
xmlFree( childName ); xmlFree( childName );
break; break;
} }
if ( childType != 1 ) { if ( childType != 1 ) {
xmlFree( childName ); xmlFree( childName );
continue; continue;
} }
if ( xmlStrEqual( childName, ( const xmlChar* ) "tag" ) == 1 ) { if ( xmlStrEqual( childName, ( const xmlChar* ) "tag" ) == 1 ) {
xmlChar* k = xmlTextReaderGetAttribute( inputReader, ( const xmlChar* ) "k" ); xmlChar* k = xmlTextReaderGetAttribute( inputReader, ( const xmlChar* ) "k" );
xmlChar* value = xmlTextReaderGetAttribute( inputReader, ( const xmlChar* ) "v" ); xmlChar* value = xmlTextReaderGetAttribute( inputReader, ( const xmlChar* ) "v" );
if ( k != NULL && value != NULL ) { if ( k != NULL && value != NULL ) {
if ( xmlStrEqual( k, ( const xmlChar* ) "highway" ) == 1 ) { if ( xmlStrEqual( k, ( const xmlChar* ) "highway" ) == 1 ) {
if ( xmlStrEqual( value, ( const xmlChar* ) "traffic_signals" ) == 1 ) if ( xmlStrEqual( value, ( const xmlChar* ) "traffic_signals" ) == 1 )
node.trafficSignal = true; node.trafficSignal = true;
} }
} }
if ( k != NULL ) if ( k != NULL )
xmlFree( k ); xmlFree( k );
if ( value != NULL ) if ( value != NULL )
xmlFree( value ); xmlFree( value );
} }
xmlFree( childName ); xmlFree( childName );
} }
} }
return node; return node;
} }
double ApproximateDistance( const int lat1, const int lon1, const int lat2, const int lon2 ) { double ApproximateDistance( const int lat1, const int lon1, const int lat2, const int lon2 ) {
static const double DEG_TO_RAD = 0.017453292519943295769236907684886; static const double DEG_TO_RAD = 0.017453292519943295769236907684886;
///Earth's quatratic mean radius for WGS-84 ///Earth's quatratic mean radius for WGS-84
static const double EARTH_RADIUS_IN_METERS = 6372797.560856; static const double EARTH_RADIUS_IN_METERS = 6372797.560856;
double latitudeArc = ( lat1/100000. - lat2/100000. ) * DEG_TO_RAD; double latitudeArc = ( lat1/100000. - lat2/100000. ) * DEG_TO_RAD;
double longitudeArc = ( lon1/100000. - lon2/100000. ) * DEG_TO_RAD; double longitudeArc = ( lon1/100000. - lon2/100000. ) * DEG_TO_RAD;
double latitudeH = sin( latitudeArc * 0.5 ); double latitudeH = sin( latitudeArc * 0.5 );
latitudeH *= latitudeH; latitudeH *= latitudeH;
double lontitudeH = sin( longitudeArc * 0.5 ); double lontitudeH = sin( longitudeArc * 0.5 );
lontitudeH *= lontitudeH; lontitudeH *= lontitudeH;
double tmp = cos( lat1/100000. * DEG_TO_RAD ) * cos( lat2/100000. * DEG_TO_RAD ); double tmp = cos( lat1/100000. * DEG_TO_RAD ) * cos( lat2/100000. * DEG_TO_RAD );
double distanceArc = 2.0 * asin( sqrt( latitudeH + tmp * lontitudeH ) ); double distanceArc = 2.0 * asin( sqrt( latitudeH + tmp * lontitudeH ) );
return EARTH_RADIUS_IN_METERS * distanceArc; return EARTH_RADIUS_IN_METERS * distanceArc;
} }
#endif /* EXTRACTORSTRUCTS_H_ */ #endif /* EXTRACTORSTRUCTS_H_ */

385
extractLargeNetwork.cpp
View File

@ -37,224 +37,231 @@ or see http://www.gnu.org/licenses/agpl.txt.
using namespace std; using namespace std;
typedef google::dense_hash_map<NodeID, _Node> NodeMap; typedef google::dense_hash_map<NodeID, _Node> NodeMap;
typedef stxxl::vector<NodeID> STXXLNodeIDVector;
typedef stxxl::vector<_Node> STXXLNodeVector;
typedef stxxl::vector<_Edge> STXXLEdgeVector;
_Stats stats;
Settings settings; Settings settings;
vector<NodeID> SignalNodes; vector<NodeID> SignalNodes;
STXXLNodeIDVector usedNodes;
STXXLNodeVector allNodes;
STXXLNodeVector confirmedNodes;
STXXLEdgeVector allEdges;
STXXLEdgeVector confirmedEdges;
NodeMap * nodeMap = new NodeMap(); NodeMap * nodeMap = new NodeMap();
int main (int argc, char *argv[]) int main (int argc, char *argv[])
{ {
if(argc <= 1) if(argc <= 1)
{ {
cerr << "usage: " << endl << argv[0] << " <file.osm>" << endl; cerr << "usage: " << endl << argv[0] << " <file.osm>" << endl;
exit(-1); exit(-1);
} }
cout << "reading input file. This may take some time ..." << flush; cout << "reading input file. This may take some time ..." << flush;
double time = get_timestamp(); double time = get_timestamp();
settings.speedProfile.names.insert(settings.speedProfile.names.begin(), names, names+13); settings.speedProfile.names.insert(settings.speedProfile.names.begin(), names, names+13);
settings.speedProfile.speed.insert(settings.speedProfile.speed.begin(), speeds, speeds+13); settings.speedProfile.speed.insert(settings.speedProfile.speed.begin(), speeds, speeds+13);
xmlTextReaderPtr inputReader = xmlNewTextReaderFilename( argv[1] ); xmlTextReaderPtr inputReader = xmlNewTextReaderFilename( argv[1] );
ofstream allNodeFile("_allnodes", ios::binary); nodeMap->set_empty_key(UINT_MAX);
ofstream usedNodesFile("_usednodes", ios::binary); try {
ofstream wayFile("_ways", ios::binary); while ( xmlTextReaderRead( inputReader ) == 1 ) {
nodeMap->set_empty_key(UINT_MAX); const int type = xmlTextReaderNodeType( inputReader );
try {
while ( xmlTextReaderRead( inputReader ) == 1 ) {
const int type = xmlTextReaderNodeType( inputReader );
//1 is Element //1 is Element
if ( type != 1 ) if ( type != 1 )
continue; continue;
xmlChar* currentName = xmlTextReaderName( inputReader ); xmlChar* currentName = xmlTextReaderName( inputReader );
if ( currentName == NULL ) if ( currentName == NULL )
continue; continue;
if ( xmlStrEqual( currentName, ( const xmlChar* ) "node" ) == 1 ) { if ( xmlStrEqual( currentName, ( const xmlChar* ) "node" ) == 1 ) {
stats.numberOfNodes++; _Node node = _ReadXMLNode( inputReader );
_Node node = _ReadXMLNode( inputReader ); allNodes.push_back(node);
allNodeFile.write((char *)&node, sizeof(node));// << node.id << node.lat << node.lon << node.trafficSignal << endl; if ( node.trafficSignal )
SignalNodes.push_back( node.id );
if ( node.trafficSignal ) }
SignalNodes.push_back( node.id ); else if ( xmlStrEqual( currentName, ( const xmlChar* ) "way" ) == 1 ) {
_Way way = _ReadXMLWay( inputReader, settings );
} if ( way.usefull && way.access && way.path.size() ) {
else if ( xmlStrEqual( currentName, ( const xmlChar* ) "way" ) == 1 ) { for ( unsigned i = 0; i < way.path.size(); ++i ) {
stats.numberOfWays++; usedNodes.push_back(way.path[i]);
_Way way = _ReadXMLWay( inputReader, settings, stats ); }
if ( way.usefull && way.access && way.path.size() ) { if ( way.direction == _Way::opposite )
for ( unsigned i = 0; i < way.path.size(); ++i ) { std::reverse( way.path.begin(), way.path.end() );
usedNodesFile.write((char *)&way.path[i], sizeof(NodeID));
}
if ( way.direction == _Way::opposite ) {
std::reverse( way.path.begin(), way.path.end() ); vector< NodeID > & path = way.path;
double speed = way.maximumSpeed;
assert(way.type > -1 || way.maximumSpeed != -1);
assert(path.size()>0);
stats.numberOfEdges += ( int ) way.path.size() - 1; for(vector< NodeID >::size_type n = 0; n < path.size()-1; n++)
{ {
vector< NodeID > & path = way.path; _Edge e;
double speed = way.maximumSpeed; e.start = way.path[n];
assert(way.type > -1 || way.maximumSpeed != -1); e.target = way.path[n+1];
assert(path.size()>0); e.type = way.type;
e.direction = way.direction;
e.speed = way.maximumSpeed;
allEdges.push_back(e);
}
}
}
}
xmlFree( currentName );
}
cout << "ok, after " << get_timestamp() - time << "s" << endl;
time = get_timestamp();
unsigned memory_to_use = 1024 * 1024 * 1024;
for(vector< NodeID >::size_type n = 0; n < path.size()-1; n++) cout << "Sorting used nodes ..." << flush;
{ stxxl::sort(usedNodes.begin(), usedNodes.end(), Cmp(), memory_to_use);
//serialize edge (path[n], path[n+1]) cout << "ok, after " << get_timestamp() - time << "s" << endl;
wayFile.write((char*)&way.path[n], sizeof(NodeID)); time = get_timestamp();
wayFile.write((char*)&way.path[n+1], sizeof(NodeID)); cout << "Erasing duplicate entries ..." << flush;
wayFile.write((char*)&way.type, sizeof(short)); stxxl::vector<NodeID>::iterator NewEnd = unique ( usedNodes.begin(),usedNodes.end() ) ;
wayFile.write((char*)&way.direction, sizeof(short)); usedNodes.resize ( NewEnd - usedNodes.begin() );
wayFile.write((char*)&way.maximumSpeed, sizeof(double)); cout << "ok, after " << get_timestamp() - time << "s" << endl;
} time = get_timestamp();
}
}
}
xmlFree( currentName );
}
allNodeFile.close();
usedNodesFile.close();
wayFile.close();
cout << "ok, after " << get_timestamp() - time << "s" << endl;
time = get_timestamp();
unsigned memory_to_use = 1024 * 1024 * 1024;
stxxl::syscall_file f("_usednodes", stxxl::file::DIRECT | stxxl::file::RDWR); cout << "Sorting all nodes ..." << flush;
typedef stxxl::vector<NodeID> usedNodesVectorType; stxxl::ksort(allNodes.begin(), allNodes.end(), memory_to_use);
cout << "ok, after " << get_timestamp() - time << "s" << endl;
time = get_timestamp();
usedNodesVectorType usedNodes( &f); string name(argv[1]);
cout << "Sorting used nodes ..." << flush; int pos=name.find(".osm"); // pos=9
stxxl::sort(usedNodes.begin(), usedNodes.end(), Cmp(), memory_to_use); if(pos!=string::npos)
cout << "ok, after " << get_timestamp() - time << "s" << endl; {
time = get_timestamp(); name.replace(pos, 5, ".osrm");
cout << "Erasing duplicate entries ..." << flush; } else {
stxxl::vector<NodeID>::iterator NewEnd = unique ( usedNodes.begin(),usedNodes.end() ) ; name.append(".osrm");
usedNodes.resize ( NewEnd - usedNodes.begin() ); }
cout << "ok, after " << get_timestamp() - time << "s" << endl;
time = get_timestamp();
stxxl::syscall_file fallnodes("_allnodes", stxxl::file::DIRECT | stxxl::file::RDWR); ofstream fout;
typedef stxxl::vector< _Node > second_vector_type; fout.open(name.c_str());
// ifstream inway("_ways", ios::binary);
second_vector_type van(&fallnodes); cout << "Writing used nodes ..." << flush;
cout << "Sorting all nodes ..." << flush; NodeID counter = 0;
stxxl::ksort(van.begin(), van.end(), memory_to_use); NodeID notfound = 0;
cout << "ok, after " << get_timestamp() - time << "s" << endl; STXXLNodeVector::iterator nvit = allNodes.begin();
time = get_timestamp(); STXXLNodeIDVector::iterator niit = usedNodes.begin();
while(niit != usedNodes.end() && nvit != allNodes.end())
{
if(*niit < nvit->id){
niit++;
continue;
}
if(*niit > nvit->id)
{
nvit++;
continue;
}
if(*niit == nvit->id)
{
confirmedNodes.push_back(*nvit);
nodeMap->insert(std::make_pair(nvit->id, *nvit));
niit++;
nvit++;
}
}
fout << confirmedNodes.size() << endl;
for(STXXLNodeVector::iterator ut = confirmedNodes.begin(); ut != confirmedNodes.end(); ut++)
{
fout << ut->id<< " " << ut->lon << " " << ut->lat << "\n";
}
cout << endl << "Statistics: " << endl; cout << "ok, after " << get_timestamp() - time << "s" << endl;
cout << "All Nodes: " << stats.numberOfNodes << endl; time = get_timestamp();
cout << "Used Nodes: " << nodeMap->size() << endl;
cout << "Number of Ways: " << stats.numberOfWays << endl;
cout << "Edges in graph: " << stats.numberOfEdges << endl;
cout << "Number of ways with maxspeed information: " << stats.numberOfMaxspeed << endl;
cout << "Number of nodes with traffic lights: " << SignalNodes.size() << endl;
cout << "finished loading data" << endl;
cout << "calculated edge weights and writing to disk ..." << flush;
string name(argv[1]);
int pos=name.find(".osm"); // pos=9
if(pos!=string::npos)
{
name.replace(pos, 5, ".osrm");
} else {
name.append(".osrm");
}
ofstream fout; cout << "confirming used ways ..." << endl;
fout.open(name.c_str()); for(STXXLEdgeVector::iterator eit = allEdges.begin(); eit != allEdges.end(); eit++)
ifstream inall("_allnodes", ios::binary); {
ifstream inuse("_usednodes", ios::binary); assert(eit->type > -1 || eit->speed != -1);
ifstream inway("_ways", ios::binary);
cout << "Writing used nodes ..." << flush; NodeMap::iterator startit = nodeMap->find(eit->start);
fout << usedNodes.size() << endl; if(startit == nodeMap->end())
NodeID counter = 0; {
for(usedNodesVectorType::iterator it = usedNodes.begin(); it!=usedNodes.end(); it++) continue;
{ }
NodeID currentNodeID = *it; NodeMap::iterator targetit = nodeMap->find(eit->target);
_Node current_Node;
inall.read((char *)&current_Node, sizeof(_Node));
while(currentNodeID!=current_Node.id)
{
inall.read((char *)&current_Node, sizeof(_Node));
}
fout << current_Node.id<< " " << current_Node.lon << " " << current_Node.lat << "\n";
nodeMap->insert(std::make_pair(current_Node.id, current_Node));
counter++;
}
cout << "ok, after " << get_timestamp() - time << "s" << endl;
time = get_timestamp();
cout << "writing used ways ..." << endl; if(targetit == nodeMap->end())
NodeID start, target; {
short type, direction; continue;
double maximumSpeed; }
fout << stats.numberOfEdges << "\n"; confirmedEdges.push_back(*eit);
while(!inway.eof()) }
{ fout << confirmedEdges.size() << "\n";
cout << "ok, after " << get_timestamp() - time << "s" << endl;
time = get_timestamp();
inway.read((char*)&start, sizeof(NodeID)); cout << "writing confirmed ways ..." << endl;
inway.read((char*)&target, sizeof(NodeID));
inway.read((char*)&type, sizeof(short));
inway.read((char*)&direction, sizeof(short));
inway.read((char*)&maximumSpeed, sizeof(double));
assert(type > -1 || maximumSpeed != -1);
NodeMap::iterator startit = nodeMap->find(start); for(STXXLEdgeVector::iterator eit = confirmedEdges.begin(); eit != confirmedEdges.end(); eit++)
if(startit == nodeMap->end()) {
{ NodeMap::iterator startit = nodeMap->find(eit->start);
cerr << "Node " << start << " missing albeit referenced in way. Edge skipped" << endl; if(startit == nodeMap->end())
continue; {
} continue;
NodeMap::iterator targetit = nodeMap->find(target); }
NodeMap::iterator targetit = nodeMap->find(eit->target);
if(targetit == nodeMap->end()) if(targetit == nodeMap->end())
{ {
cerr << "Node << " << target << "missing albeit reference in a way. Edge skipped" << endl; continue;
continue; }
} double distance = ApproximateDistance(startit->second.lat, startit->second.lon, targetit->second.lat, targetit->second.lon);
if(eit->speed == -1)
eit->speed = settings.speedProfile.speed[eit->type];
double weight = ( distance * 10. ) / (eit->speed / 3.6);
double intWeight = max(1, (int) weight);
switch(eit->direction)
{
case _Way::notSure:
fout << startit->first << " " << targetit->first << " " << max(1, (int)distance) << " " << 0 << " " << intWeight << "\n";
break;
case _Way::oneway:
fout << startit->first << " " << targetit->first << " " << max(1, (int)distance) << " " << 1 << " " << intWeight << "\n";
break;
case _Way::bidirectional:
fout << startit->first << " " << targetit->first << " " << max(1, (int)distance) << " " << 0 << " " << intWeight << "\n";
break;
case _Way::opposite:
fout << startit->first << " " << targetit->first << " " << max(1, (int)distance) << " " << 1 << " " << intWeight << "\n";
break;
default:
assert(false);
break;
}
}
fout.close();
cout << "ok, after " << get_timestamp() - time << "s" << endl;
time = get_timestamp();
} catch ( const std::exception& e ) {
cerr << "Caught Execption:" << e.what() << endl;
return false;
}
double distance = ApproximateDistance(startit->second.lat, startit->second.lon, targetit->second.lat, targetit->second.lon); cout << endl << "Statistics:" << endl;
if(maximumSpeed == -1) cout << "-----------" << endl;
maximumSpeed = settings.speedProfile.speed[type]; cout << "Usable Nodes: " << confirmedNodes.size() << endl;
double weight = ( distance * 10. ) / (maximumSpeed / 3.6); cout << "Usable Ways : " << confirmedEdges.size() << endl;
double intWeight = max(1, (int) weight);
switch(direction)
{
case _Way::notSure:
fout << startit->first << " " << targetit->first << " " << max(1, (int)distance) << " " << 0 << " " << intWeight << "\n";
break;
case _Way::oneway:
fout << startit->first << " " << targetit->first << " " << max(1, (int)distance) << " " << 1 << " " << intWeight << "\n";
break;
case _Way::bidirectional:
fout << startit->first << " " << targetit->first << " " << max(1, (int)distance) << " " << 0 << " " << intWeight << "\n";
break;
case _Way::opposite:
fout << startit->first << " " << targetit->first << " " << max(1, (int)distance) << " " << 1 << " " << intWeight << "\n";
break;
default:
assert(false);
break;
}
}
inway.close();
fout.close();
cout << "ok, after " << get_timestamp() - time << "s" << endl;
time = get_timestamp();
} catch ( const std::exception& e ) {
cerr << "Caught Execption:" << e.what() << endl;
return false;
}
SignalNodes.clear();
xmlFreeTextReader(inputReader);
remove("_allnodes"); SignalNodes.clear();
remove("_usednodes"); usedNodes.clear();
remove("_ways"); allNodes.clear();
return true; confirmedNodes.clear();
allEdges.clear();
confirmedEdges.clear();
xmlFreeTextReader(inputReader);
return 0;
} }

171
extractNetwork.cpp
View File

@ -18,180 +18,13 @@ Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
or see http://www.gnu.org/licenses/agpl.txt. or see http://www.gnu.org/licenses/agpl.txt.
*/ */
#include <cassert>
#include <climits>
#include <cstdlib>
#include <iostream> #include <iostream>
#include <string>
#include <sstream>
#include <vector>
#include <libxml/xmlreader.h>
#include <google/sparse_hash_map>
#include "typedefs.h"
#include "DataStructures/extractorStructs.h"
using namespace std; using namespace std;
typedef google::dense_hash_map<NodeID, _Node> NodeMap;
_Stats stats;
Settings settings;
NodeMap AllNodes;
vector<NodeID> SignalNodes;
vector<NodeID> UsedNodes;
vector<_Way> UsedWays;
int main (int argc, char *argv[]) int main (int argc, char *argv[])
{ {
if(argc <= 1) cerr << argv[0] << " is deprecated. Use extractLargeNetwork" << endl;
{ return -1;
cerr << "usage: " << endl << argv[0] << " <file.osm>" << endl;
exit(-1);
}
cout << "reading input file. This may take some time ..." << flush;
settings.speedProfile.names.insert(settings.speedProfile.names.begin(), names, names+13);
settings.speedProfile.speed.insert(settings.speedProfile.speed.begin(), speeds, speeds+13);
AllNodes.set_empty_key(UINT_MAX);
xmlTextReaderPtr inputReader = xmlNewTextReaderFilename( argv[1] );
ofstream nodeFile("_nodes", ios::binary);
ofstream wayFile("_ways", ios::binary);
try {
while ( xmlTextReaderRead( inputReader ) == 1 ) {
const int type = xmlTextReaderNodeType( inputReader );
//1 is Element
if ( type != 1 )
continue;
xmlChar* currentName = xmlTextReaderName( inputReader );
if ( currentName == NULL )
continue;
if ( xmlStrEqual( currentName, ( const xmlChar* ) "node" ) == 1 ) {
stats.numberOfNodes++;
_Node node = _ReadXMLNode( inputReader );
AllNodes.insert(make_pair(node.id, node) );
if ( node.trafficSignal )
SignalNodes.push_back( node.id );
}
else if ( xmlStrEqual( currentName, ( const xmlChar* ) "way" ) == 1 ) {
stats.numberOfWays++;
_Way way = _ReadXMLWay( inputReader, settings, stats );
if ( way.usefull && way.access && way.path.size() ) {
for ( unsigned i = 0; i < way.path.size(); ++i ) {
UsedNodes.push_back( way.path[i] );
}
if ( way.direction == _Way::opposite )
std::reverse( way.path.begin(), way.path.end() );
stats.numberOfEdges += ( int ) way.path.size() - 1;
UsedWays.push_back(way);
}
}
xmlFree( currentName );
}
sort(UsedNodes.begin(), UsedNodes.end());
UsedNodes.erase(unique(UsedNodes.begin(), UsedNodes.end()), UsedNodes.end() );
sort(SignalNodes.begin(), SignalNodes.end());
SignalNodes.erase(unique(SignalNodes.begin(), SignalNodes.end()), SignalNodes.end() );
cout << "ok" << endl;
cout << endl << "Statistics: " << endl;
cout << "All Nodes: " << stats.numberOfNodes << endl;
cout << "Used Nodes: " << UsedNodes.size() << endl;
cout << "Number of Ways: " << stats.numberOfWays << endl;
cout << "Edges in graph: " << stats.numberOfEdges << endl;
cout << "Number of ways with maxspeed information: " << stats.numberOfMaxspeed << endl;
cout << "Number of nodes with traffic lights: " << SignalNodes.size() << endl;
cout << "finished loading data" << endl;
cout << "calculated edge weights and writing to disk ..." << flush;
string name(argv[1]);
int pos=name.find(".osm"); // pos=9
if(pos!=string::npos)
{
//replace
name.replace(pos, 5, ".osrm");
} else {
name.append(".osrm");
}
ofstream fout;
fout.open(name.c_str());
fout << UsedNodes.size() << endl;
for(vector<NodeID>::size_type i = 0; i < UsedNodes.size(); i++)
{
NodeMap::iterator it = AllNodes.find(UsedNodes[i]);
assert(it!=AllNodes.end());
fout << UsedNodes[i] << " " << it->second.lon << " " << it->second.lat << "\n";
}
fout << flush;
UsedNodes.clear();
fout << stats.numberOfEdges << endl;
for(vector<_Way>::size_type i = 0; i < UsedWays.size(); i++)
{
vector< NodeID > & path = UsedWays[i].path;
double speed = UsedWays[i].maximumSpeed;
assert(UsedWays[i].type > -1 || UsedWays[i].maximumSpeed != -1);
assert(path.size()>0);
for(vector< NodeID >::size_type n = 0; n < path.size()-1; n++)
{
//insert path[n], path[n+1]
NodeMap::iterator startit = AllNodes.find(path[n]);
if(startit == AllNodes.end())
{
cerr << "Node " << path[n] << " missing albeit referenced in way. Edge skipped" << endl;
continue;
}
NodeMap::iterator targetit = AllNodes.find(path[n+1]);
if(targetit == AllNodes.end())
{
cerr << "Node << " << path[n+1] << "missing albeit reference in a way. Edge skipped" << endl;
continue;
}
double distance = ApproximateDistance(startit->second.lat, startit->second.lon, targetit->second.lat, targetit->second.lon);
if(speed == -1)
speed = settings.speedProfile.speed[UsedWays[i].type];
double weight = ( distance * 10. ) / (speed / 3.6);
double intWeight = max(1, (int) weight);
switch(UsedWays[i].direction)
{
case _Way::notSure:
fout << startit->first << " " << targetit->first << " " << max(1, (int)distance) << " " << 0 << " " << intWeight << "\n";
break;
case _Way::oneway:
fout << startit->first << " " << targetit->first << " " << max(1, (int)distance) << " " << 1 << " " << intWeight << "\n";
break;
case _Way::bidirectional:
fout << startit->first << " " << targetit->first << " " << max(1, (int)distance) << " " << 0 << " " << intWeight << "\n";
break;
case _Way::opposite:
fout << startit->first << " " << targetit->first << " " << max(1, (int)distance) << " " << 1 << " " << intWeight << "\n";
break;
default:
assert(false);
break;
}
}
}
fout.close();
cout << "ok" << endl;
} catch ( const std::exception& e ) {
cerr << "Caught Execption:" << e.what() << endl;
return false;
}
AllNodes.clear();
SignalNodes.clear();
UsedWays.clear();
xmlFreeTextReader(inputReader);
return true;
} }