double BearingAngle(Nodes *nodes,Segment *segmentp,index_t node)
{
double lat1,lat2;
double lon1,lon2;
double angle;
index_t node1,node2;
node1=node;
node2=OtherNode(segmentp,node);
if(IsFakeNode(node1))
GetFakeLatLong(node1,&lat1,&lon1);
else
GetLatLong(nodes,node1,NULL,&lat1,&lon1);
if(IsFakeNode(node2))
GetFakeLatLong(node2,&lat2,&lon2);
else
GetLatLong(nodes,node2,NULL,&lat2,&lon2);
angle=atan2((lat2-lat1),(lon2-lon1)*cos(lat1));
angle=radians_to_degrees(angle);
angle=270-angle;
if(angle< 0) angle+=360;
if(angle>360) angle-=360;
return(angle);
}
double TurnAngle(Nodes *nodes,Segment *segment1p,Segment *segment2p,index_t node)
{
double lat1,latm,lat2;
double lon1,lonm,lon2;
double angle1,angle2,angle;
index_t node1,node2;
node1=OtherNode(segment1p,node);
node2=OtherNode(segment2p,node);
if(IsFakeNode(node1))
GetFakeLatLong(node1,&lat1,&lon1);
else
GetLatLong(nodes,node1,NULL,&lat1,&lon1);
if(IsFakeNode(node))
GetFakeLatLong(node,&latm,&lonm);
else
GetLatLong(nodes,node,NULL,&latm,&lonm);
if(IsFakeNode(node2))
GetFakeLatLong(node2,&lat2,&lon2);
else
GetLatLong(nodes,node2,NULL,&lat2,&lon2);
angle1=atan2((lonm-lon1)*cos(latm),(latm-lat1));
angle2=atan2((lon2-lonm)*cos(latm),(lat2-latm));
angle=angle2-angle1;
angle=radians_to_degrees(angle);
if(angle<-180) angle+=360;
if(angle> 180) angle-=360;
return(angle);
}
int main(int argc,char** argv)
{
Nodes *OSMNodes;
Segments *OSMSegments;
Ways *OSMWays;
Relations *OSMRelations;
Results *results[NWAYPOINTS+1]={NULL};
int point_used[NWAYPOINTS+1]={0};
double point_lon[NWAYPOINTS+1],point_lat[NWAYPOINTS+1];
index_t point_node[NWAYPOINTS+1]={NO_NODE};
double heading=-999;
int help_profile=0,help_profile_xml=0,help_profile_json=0,help_profile_pl=0;
char *dirname=NULL,*prefix=NULL;
char *profiles=NULL,*profilename=NULL;
char *translations=NULL,*language=NULL;
int exactnodes=0,reverse=0,loop=0;
Transport transport=Transport_None;
Profile *profile=NULL;
Translation *translation=NULL;
index_t start_node,finish_node=NO_NODE;
index_t join_segment=NO_SEGMENT;
int arg,nresults=0;
waypoint_t start_waypoint,finish_waypoint=NO_WAYPOINT;
waypoint_t first_waypoint=NWAYPOINTS,last_waypoint=1,waypoint;
int inc_dec_waypoint=1;
printf_program_start();
/* Parse the command line arguments */
if(argc<2)
print_usage(0,NULL,NULL);
/* Get the non-routing, general program options */
for(arg=1;arg<argc;arg++)
{
if(!strcmp(argv[arg],"--version"))
print_usage(-1,NULL,NULL);
else if(!strcmp(argv[arg],"--help"))
print_usage(1,NULL,NULL);
else if(!strcmp(argv[arg],"--help-profile"))
help_profile=1;
else if(!strcmp(argv[arg],"--help-profile-xml"))
help_profile_xml=1;
else if(!strcmp(argv[arg],"--help-profile-json"))
help_profile_json=1;
else if(!strcmp(argv[arg],"--help-profile-perl"))
help_profile_pl=1;
else if(!strncmp(argv[arg],"--dir=",6))
dirname=&argv[arg][6];
else if(!strncmp(argv[arg],"--prefix=",9))
prefix=&argv[arg][9];
else if(!strncmp(argv[arg],"--profiles=",11))
profiles=&argv[arg][11];
else if(!strncmp(argv[arg],"--translations=",15))
translations=&argv[arg][15];
else if(!strcmp(argv[arg],"--exact-nodes-only"))
exactnodes=1;
else if(!strncmp(argv[arg],"--reverse",9))
{
if(argv[arg][9]=='=')
reverse=atoi(&argv[arg][10]);
else
reverse=1;
}
else if(!strncmp(argv[arg],"--loop",6))
{
if(argv[arg][6]=='=')
loop=atoi(&argv[arg][7]);
else
loop=1;
}
else if(!strcmp(argv[arg],"--quiet"))
option_quiet=1;
else if(!strcmp(argv[arg],"--loggable"))
option_loggable=1;
else if(!strcmp(argv[arg],"--logtime"))
option_logtime=2;
else if(!strcmp(argv[arg],"--logmemory"))
option_logmemory=1;
else if(!strcmp(argv[arg],"--output-html"))
option_file_html=1;
else if(!strcmp(argv[arg],"--output-gpx-track"))
option_file_gpx_track=1;
else if(!strcmp(argv[arg],"--output-gpx-route"))
option_file_gpx_route=1;
else if(!strcmp(argv[arg],"--output-text"))
option_file_text=1;
else if(!strcmp(argv[arg],"--output-text-all"))
option_file_text_all=1;
else if(!strcmp(argv[arg],"--output-none"))
option_file_none=1;
else if(!strcmp(argv[arg],"--output-stdout"))
{ option_file_stdout=1; option_quiet=1; }
else if(!strncmp(argv[arg],"--profile=",10))
profilename=&argv[arg][10];
else if(!strncmp(argv[arg],"--language=",11))
language=&argv[arg][11];
else if(!strcmp(argv[arg],"--shortest"))
option_quickest=0;
else if(!strcmp(argv[arg],"--quickest"))
option_quickest=1;
else if(!strncmp(argv[arg],"--lon",5) && isdigit(argv[arg][5]))
{
int point;
char *p=&argv[arg][6];
while(isdigit(*p)) p++;
if(*p++!='=')
print_usage(0,argv[arg],NULL);
point=atoi(&argv[arg][5]);
if(point>NWAYPOINTS || point_used[point]&1)
print_usage(0,argv[arg],NULL);
point_lon[point]=degrees_to_radians(atof(p));
point_used[point]+=1;
if(point<first_waypoint)
first_waypoint=point;
if(point>last_waypoint)
last_waypoint=point;
}
else if(!strncmp(argv[arg],"--lat",5) && isdigit(argv[arg][5]))
{
int point;
char *p=&argv[arg][6];
while(isdigit(*p)) p++;
if(*p++!='=')
print_usage(0,argv[arg],NULL);
point=atoi(&argv[arg][5]);
if(point>NWAYPOINTS || point_used[point]&2)
print_usage(0,argv[arg],NULL);
point_lat[point]=degrees_to_radians(atof(p));
point_used[point]+=2;
if(point<first_waypoint)
first_waypoint=point;
if(point>last_waypoint)
last_waypoint=point;
}
else if(!strncmp(argv[arg],"--heading=",10))
{
double h=atof(&argv[arg][10]);
if(h>=-360 && h<=360)
{
heading=h;
if(heading<0) heading+=360;
}
}
else if(!strncmp(argv[arg],"--transport=",12))
{
transport=TransportType(&argv[arg][12]);
if(transport==Transport_None)
print_usage(0,argv[arg],NULL);
}
else
continue;
argv[arg]=NULL;
}
/* Check the specified command line options */
if(option_file_stdout && (option_file_html+option_file_gpx_track+option_file_gpx_route+option_file_text+option_file_text_all)!=1)
{
fprintf(stderr,"Error: The '--output-stdout' option requires exactly one other output option (but not '--output-none').\n");
exit(EXIT_FAILURE);
}
if(option_file_html==0 && option_file_gpx_track==0 && option_file_gpx_route==0 && option_file_text==0 && option_file_text_all==0 && option_file_none==0)
option_file_html=option_file_gpx_track=option_file_gpx_route=option_file_text=option_file_text_all=1;
/* Load in the selected profiles */
if(transport==Transport_None)
transport=Transport_Motorcar;
if(profiles)
{
if(!ExistsFile(profiles))
{
fprintf(stderr,"Error: The '--profiles' option specifies a file '%s' that does not exist.\n",profiles);
exit(EXIT_FAILURE);
}
}
else
{
profiles=FileName(dirname,prefix,"profiles.xml");
if(!ExistsFile(profiles))
{
char *defaultprofiles=FileName(ROUTINO_DATADIR,NULL,"profiles.xml");
if(!ExistsFile(defaultprofiles))
{
fprintf(stderr,"Error: The '--profiles' option was not used and the files '%s' and '%s' do not exist.\n",profiles,defaultprofiles);
exit(EXIT_FAILURE);
}
free(profiles);
profiles=defaultprofiles;
}
}
if(!profilename)
profilename=(char*)TransportName(transport);
if(ParseXMLProfiles(profiles,profilename,(help_profile_xml|help_profile_json|help_profile_pl)))
{
fprintf(stderr,"Error: Cannot read the profiles in the file '%s'.\n",profiles);
exit(EXIT_FAILURE);
}
profile=GetProfile(profilename);
if(!profile)
{
fprintf(stderr,"Error: Cannot find a profile called '%s' in the file '%s'.\n",profilename,profiles);
profile=(Profile*)calloc(1,sizeof(Profile));
profile->transport=transport;
}
/* Parse the other command line arguments that modify the profile */
for(arg=1;arg<argc;arg++)
{
if(!argv[arg])
continue;
else if(!strncmp(argv[arg],"--highway-",10))
{
Highway highway;
char *equal=strchr(argv[arg],'=');
char *string;
double p;
if(!equal)
print_usage(0,argv[arg],NULL);
string=strcpy((char*)malloc(strlen(argv[arg])),argv[arg]+10);
string[equal-argv[arg]-10]=0;
highway=HighwayType(string);
if(highway==Highway_None)
print_usage(0,argv[arg],NULL);
p=atof(equal+1);
if(p<0 || p>100)
print_usage(0,argv[arg],NULL);
profile->highway[highway]=(score_t)(p/100);
free(string);
}
else if(!strncmp(argv[arg],"--speed-",8))
{
Highway highway;
char *equal=strchr(argv[arg],'=');
char *string;
double s;
if(!equal)
print_usage(0,argv[arg],NULL);
string=strcpy((char*)malloc(strlen(argv[arg])),argv[arg]+8);
string[equal-argv[arg]-8]=0;
highway=HighwayType(string);
if(highway==Highway_None)
print_usage(0,argv[arg],NULL);
s=atof(equal+1);
if(s<0)
print_usage(0,argv[arg],NULL);
profile->speed[highway]=kph_to_speed(s);
free(string);
}
else if(!strncmp(argv[arg],"--property-",11))
{
Property property;
char *equal=strchr(argv[arg],'=');
char *string;
double p;
if(!equal)
print_usage(0,argv[arg],NULL);
string=strcpy((char*)malloc(strlen(argv[arg])),argv[arg]+11);
string[equal-argv[arg]-11]=0;
property=PropertyType(string);
if(property==Property_None)
print_usage(0,argv[arg],NULL);
p=atof(equal+1);
if(p<0 || p>100)
print_usage(0,argv[arg],NULL);
profile->props[property]=(score_t)(p/100);
free(string);
}
else if(!strncmp(argv[arg],"--oneway=",9))
profile->oneway=!!atoi(&argv[arg][9]);
else if(!strncmp(argv[arg],"--turns=",8))
profile->turns=!!atoi(&argv[arg][8]);
else if(!strncmp(argv[arg],"--weight=",9))
profile->weight=tonnes_to_weight(atof(&argv[arg][9]));
else if(!strncmp(argv[arg],"--height=",9))
profile->height=metres_to_height(atof(&argv[arg][9]));
else if(!strncmp(argv[arg],"--width=",8))
profile->width=metres_to_width(atof(&argv[arg][8]));
else if(!strncmp(argv[arg],"--length=",9))
profile->length=metres_to_length(atof(&argv[arg][9]));
else
print_usage(0,argv[arg],NULL);
}
/* Print one of the profiles if requested */
if(help_profile)
{
PrintProfile(profile);
exit(EXIT_SUCCESS);
}
else if(help_profile_xml)
{
PrintProfilesXML();
exit(EXIT_SUCCESS);
}
else if(help_profile_json)
{
PrintProfilesJSON();
exit(EXIT_SUCCESS);
}
else if(help_profile_pl)
{
PrintProfilesPerl();
exit(EXIT_SUCCESS);
}
/* Load in the selected translation */
if(option_file_html || option_file_gpx_route || option_file_gpx_track || option_file_text || option_file_text_all)
{
if(translations)
{
if(!ExistsFile(translations))
{
fprintf(stderr,"Error: The '--translations' option specifies a file '%s' that does not exist.\n",translations);
exit(EXIT_FAILURE);
}
}
else
{
translations=FileName(dirname,prefix,"translations.xml");
if(!ExistsFile(translations))
{
char *defaulttranslations=FileName(ROUTINO_DATADIR,NULL,"translations.xml");
if(!ExistsFile(defaulttranslations))
{
fprintf(stderr,"Error: The '--translations' option was not used and the files '%s' and '%s' do not exist.\n",translations,defaulttranslations);
exit(EXIT_FAILURE);
}
free(translations);
translations=defaulttranslations;
}
}
if(ParseXMLTranslations(translations,language,0))
{
fprintf(stderr,"Error: Cannot read the translations in the file '%s'.\n",translations);
exit(EXIT_FAILURE);
}
if(language)
{
translation=GetTranslation(language);
if(!translation)
{
fprintf(stderr,"Warning: Cannot find a translation called '%s' in the file '%s'.\n",language,translations);
exit(EXIT_FAILURE);
}
}
else
{
translation=GetTranslation("");
if(!translation)
{
fprintf(stderr,"Warning: No translations in '%s'.\n",translations);
exit(EXIT_FAILURE);
}
}
}
/* Check the waypoints are valid */
for(waypoint=1;waypoint<=NWAYPOINTS;waypoint++)
if(point_used[waypoint]==1 || point_used[waypoint]==2)
print_usage(0,NULL,"All waypoints must have latitude and longitude.");
if(first_waypoint>=last_waypoint)
print_usage(0,NULL,"At least two waypoints must be specified.");
/* Load in the data - Note: No error checking because Load*List() will call exit() in case of an error. */
if(!option_quiet)
printf_first("Loading Files:");
OSMNodes=LoadNodeList(FileName(dirname,prefix,"nodes.mem"));
OSMSegments=LoadSegmentList(FileName(dirname,prefix,"segments.mem"));
OSMWays=LoadWayList(FileName(dirname,prefix,"ways.mem"));
OSMRelations=LoadRelationList(FileName(dirname,prefix,"relations.mem"));
if(!option_quiet)
printf_last("Loaded Files: nodes, segments, ways & relations");
/* Check the profile is valid for use with this database */
if(UpdateProfile(profile,OSMWays))
{
fprintf(stderr,"Error: Profile is invalid or not compatible with database.\n");
exit(EXIT_FAILURE);
}
/* Find all waypoints */
for(waypoint=first_waypoint;waypoint<=last_waypoint;waypoint++)
{
distance_t distmax=km_to_distance(MAXSEARCH);
distance_t distmin;
index_t segment=NO_SEGMENT;
index_t node1,node2,node=NO_NODE;
if(point_used[waypoint]!=3)
continue;
/* Find the closest point */
if(!option_quiet)
printf_first("Finding Closest Point: Waypoint %d",waypoint);
if(exactnodes)
node=FindClosestNode(OSMNodes,OSMSegments,OSMWays,point_lat[waypoint],point_lon[waypoint],distmax,profile,&distmin);
else
{
distance_t dist1,dist2;
segment=FindClosestSegment(OSMNodes,OSMSegments,OSMWays,point_lat[waypoint],point_lon[waypoint],distmax,profile,&distmin,&node1,&node2,&dist1,&dist2);
if(segment!=NO_SEGMENT)
node=CreateFakes(OSMNodes,OSMSegments,waypoint,LookupSegment(OSMSegments,segment,1),node1,node2,dist1,dist2);
}
if(!option_quiet)
printf_last("Found Closest Point: Waypoint %d",waypoint);
if(node==NO_NODE)
{
fprintf(stderr,"Error: Cannot find node close to specified point %d.\n",waypoint);
exit(EXIT_FAILURE);
}
if(!option_quiet)
{
double lat,lon;
if(IsFakeNode(node))
GetFakeLatLong(node,&lat,&lon);
else
GetLatLong(OSMNodes,node,NULL,&lat,&lon);
if(IsFakeNode(node))
printf("Waypoint %d is segment %"Pindex_t" (node %"Pindex_t" -> %"Pindex_t"): %3.6f %4.6f = %2.3f km\n",waypoint,segment,node1,node2,
radians_to_degrees(lon),radians_to_degrees(lat),distance_to_km(distmin));
else
printf("Waypoint %d is node %"Pindex_t": %3.6f %4.6f = %2.3f km\n",waypoint,node,
radians_to_degrees(lon),radians_to_degrees(lat),distance_to_km(distmin));
}
point_node[waypoint]=node;
}
/* Check for reverse direction */
if(reverse)
{
waypoint_t temp;
temp=first_waypoint;
first_waypoint=last_waypoint;
last_waypoint=temp;
inc_dec_waypoint=-1;
}
/* Loop through all pairs of waypoints */
if(loop && reverse)
{
finish_node=point_node[last_waypoint];
finish_waypoint=last_waypoint;
}
for(waypoint=first_waypoint;waypoint!=(last_waypoint+inc_dec_waypoint);waypoint+=inc_dec_waypoint)
{
if(point_used[waypoint]!=3)
continue;
start_node=finish_node;
finish_node=point_node[waypoint];
start_waypoint=finish_waypoint;
finish_waypoint=waypoint;
if(start_node==NO_NODE)
continue;
if(heading!=-999 && join_segment==NO_SEGMENT)
join_segment=FindClosestSegmentHeading(OSMNodes,OSMSegments,OSMWays,start_node,heading,profile);
/* Calculate the route */
if(!option_quiet)
printf("Routing from waypoint %d to waypoint %d\n",start_waypoint,finish_waypoint);
results[nresults]=CalculateRoute(OSMNodes,OSMSegments,OSMWays,OSMRelations,profile,start_node,join_segment,finish_node,start_waypoint,finish_waypoint);
if(!results[nresults])
exit(EXIT_FAILURE);
join_segment=results[nresults]->last_segment;
nresults++;
}
if(loop && !reverse)
{
start_node=finish_node;
finish_node=point_node[first_waypoint];
start_waypoint=finish_waypoint;
finish_waypoint=first_waypoint;
/* Calculate the route */
if(!option_quiet)
printf("Routing from waypoint %d to waypoint %d\n",start_waypoint,finish_waypoint);
results[nresults]=CalculateRoute(OSMNodes,OSMSegments,OSMWays,OSMRelations,profile,start_node,join_segment,finish_node,start_waypoint,finish_waypoint);
if(!results[nresults])
exit(EXIT_FAILURE);
nresults++;
}
if(!option_quiet)
{
printf("Routed OK\n");
fflush(stdout);
}
/* Print out the combined route */
if(!option_quiet)
printf_first("Generating Result Outputs");
if(!option_file_none)
PrintRoute(results,nresults,OSMNodes,OSMSegments,OSMWays,OSMRelations,profile,translation);
if(!option_quiet)
printf_last("Generated Result Outputs");
/* Destroy the remaining results lists and data structures */
#ifdef DEBUG_MEMORY_LEAK
for(waypoint=0;waypoint<nresults;waypoint++)
FreeResultsList(results[waypoint]);
DestroyNodeList(OSMNodes);
DestroySegmentList(OSMSegments);
DestroyWayList(OSMWays);
DestroyRelationList(OSMRelations);
FreeXMLProfiles();
FreeXMLTranslations();
#endif
if(!option_quiet)
printf_program_end();
exit(EXIT_SUCCESS);
}
Results *FindNormalRoute(Nodes *nodes,Segments *segments,Ways *ways,index_t start,index_t finish,Profile *profile)
{
Results *results;
Queue *queue;
index_t node1,node2;
score_t finish_score;
double finish_lat,finish_lon;
Result *result1,*result2;
Segment *segment;
Way *way;
/* Set up the finish conditions */
finish_score=INF_SCORE;
if(IsFakeNode(finish))
GetFakeLatLong(finish,&finish_lat,&finish_lon);
else
GetLatLong(nodes,finish,&finish_lat,&finish_lon);
/* Create the list of results and insert the first node into the queue */
results=NewResultsList(8);
results->start=start;
results->finish=finish;
result1=InsertResult(results,start);
ZeroResult(result1);
queue=NewQueueList();
InsertInQueue(queue,result1);
/* Loop across all nodes in the queue */
while((result1=PopFromQueue(queue)))
{
if(result1->score>finish_score)
continue;
node1=result1->node;
if(IsFakeNode(node1))
segment=FirstFakeSegment(node1);
else
segment=FirstSegment(segments,nodes,node1);
while(segment)
{
score_t segment_pref,segment_score,cumulative_score;
int i;
node2=OtherNode(segment,node1); /* need this here because we use node2 later */
if(!IsNormalSegment(segment))
goto endloop;
if(profile->oneway && IsOnewayTo(segment,node1))
goto endloop;
if(result1->prev==node2)
goto endloop;
if(node2!=finish && !IsFakeNode(node2) && IsSuperNode(nodes,node2))
goto endloop;
way=LookupWay(ways,segment->way);
if(!(way->allow&profile->allow))
goto endloop;
if(!profile->highway[HIGHWAY(way->type)])
goto endloop;
if(way->weight && way->weight<profile->weight)
goto endloop;
if((way->height && way->height<profile->height) ||
(way->width && way->width <profile->width ) ||
(way->length && way->length<profile->length))
goto endloop;
segment_pref=profile->highway[HIGHWAY(way->type)];
for(i=1;i<Property_Count;i++)
if(ways->props & PROPERTIES(i))
{
if(way->props & PROPERTIES(i))
segment_pref*=profile->props_yes[i];
else
segment_pref*=profile->props_no[i];
}
if(segment_pref==0)
goto endloop;
if(option_quickest==0)
segment_score=(score_t)DISTANCE(segment->distance)/segment_pref;
else
segment_score=(score_t)Duration(segment,way,profile)/segment_pref;
cumulative_score=result1->score+segment_score;
if(cumulative_score>finish_score)
goto endloop;
result2=FindResult(results,node2);
if(!result2) /* New end node */
{
result2=InsertResult(results,node2);
result2->prev=node1;
result2->next=NO_NODE;
result2->score=cumulative_score;
result2->segment=segment;
if(node2==finish)
{
finish_score=cumulative_score;
}
else
{
result2->sortby=result2->score;
InsertInQueue(queue,result2);
}
}
else if(cumulative_score<result2->score) /* New end node is better */
{
result2->prev=node1;
result2->score=cumulative_score;
result2->segment=segment;
if(node2==finish)
{
finish_score=cumulative_score;
}
else
{
result2->sortby=result2->score;
if(result2->score<finish_score)
InsertInQueue(queue,result2);
}
}
endloop:
if(IsFakeNode(node1))
segment=NextFakeSegment(segment,node1);
else if(IsFakeNode(node2))
segment=NULL; /* cannot call NextSegment() with a fake segment */
else
{
segment=NextSegment(segments,segment,node1);
if(!segment && IsFakeNode(finish))
segment=ExtraFakeSegment(node1,finish);
}
}
}
FreeQueueList(queue);
/* Check it worked */
if(!FindResult(results,finish))
{
FreeResultsList(results);
return(NULL);
}
FixForwardRoute(results,finish);
return(results);
}
Results *FindMiddleRoute(Nodes *nodes,Segments *segments,Ways *ways,Results *begin,Results *end,Profile *profile)
{
Results *results;
Queue *queue;
index_t node1,node2;
index_t end_prev;
score_t finish_score;
double finish_lat,finish_lon;
Result *result1,*result2,*result3;
Segment *segment;
Way *way;
if(!option_quiet)
{
printf("Routing: Super-Nodes checked = 0");
fflush(stdout);
}
/* Set up the finish conditions */
finish_score=INF_DISTANCE;
end_prev=NO_NODE;
if(IsFakeNode(end->finish))
GetFakeLatLong(end->finish,&finish_lat,&finish_lon);
else
GetLatLong(nodes,end->finish,&finish_lat,&finish_lon);
/* Create the list of results and insert the first node into the queue */
results=NewResultsList(2048);
results->start=begin->start;
results->finish=end->finish;
result1=InsertResult(results,begin->start);
result3=FindResult(begin,begin->start);
*result1=*result3;
queue=NewQueueList();
/* Insert the finish points of the beginning part of the path into the queue */
result3=FirstResult(begin);
while(result3)
{
if(result3->node!=begin->start && !IsFakeNode(result3->node) && IsSuperNode(nodes,result3->node))
{
result2=InsertResult(results,result3->node);
*result2=*result3;
result2->prev=begin->start;
result2->sortby=result2->score;
InsertInQueue(queue,result2);
}
result3=NextResult(begin,result3);
}
if(begin->number==1)
InsertInQueue(queue,result1);
/* Loop across all nodes in the queue */
while((result1=PopFromQueue(queue)))
{
if(result1->score>finish_score)
continue;
node1=result1->node;
segment=FirstSegment(segments,nodes,node1);
while(segment)
{
score_t segment_pref,segment_score,cumulative_score;
int i;
if(!IsSuperSegment(segment))
goto endloop;
if(profile->oneway && IsOnewayTo(segment,node1))
goto endloop;
node2=OtherNode(segment,node1);
if(result1->prev==node2)
goto endloop;
way=LookupWay(ways,segment->way);
if(!(way->allow&profile->allow))
goto endloop;
if(!profile->highway[HIGHWAY(way->type)])
goto endloop;
if(way->weight && way->weight<profile->weight)
goto endloop;
if((way->height && way->height<profile->height) ||
(way->width && way->width <profile->width ) ||
(way->length && way->length<profile->length))
goto endloop;
segment_pref=profile->highway[HIGHWAY(way->type)];
for(i=1;i<Property_Count;i++)
if(ways->props & PROPERTIES(i))
{
if(way->props & PROPERTIES(i))
segment_pref*=profile->props_yes[i];
else
segment_pref*=profile->props_no[i];
}
if(segment_pref==0)
goto endloop;
if(option_quickest==0)
segment_score=(score_t)DISTANCE(segment->distance)/segment_pref;
else
segment_score=(score_t)Duration(segment,way,profile)/segment_pref;
cumulative_score=result1->score+segment_score;
if(cumulative_score>finish_score)
goto endloop;
result2=FindResult(results,node2);
if(!result2) /* New end node */
{
result2=InsertResult(results,node2);
result2->prev=node1;
result2->next=NO_NODE;
result2->score=cumulative_score;
result2->segment=segment;
if((result3=FindResult(end,node2)))
{
if((result2->score+result3->score)<finish_score)
{
finish_score=result2->score+result3->score;
end_prev=node2;
}
}
else
{
double lat,lon;
distance_t direct;
GetLatLong(nodes,node2,&lat,&lon);
direct=Distance(lat,lon,finish_lat,finish_lon);
if(option_quickest==0)
result2->sortby=result2->score+(score_t)direct/profile->max_pref;
else
result2->sortby=result2->score+(score_t)distance_speed_to_duration(direct,profile->max_speed)/profile->max_pref;
InsertInQueue(queue,result2);
}
}
else if(cumulative_score<result2->score) /* New end node is better */
{
result2->prev=node1;
result2->score=cumulative_score;
result2->segment=segment;
if((result3=FindResult(end,node2)))
{
if((result2->score+result3->score)<finish_score)
{
finish_score=result2->score+result3->score;
end_prev=node2;
}
}
else if(result2->score<finish_score)
{
double lat,lon;
distance_t direct;
GetLatLong(nodes,node2,&lat,&lon);
direct=Distance(lat,lon,finish_lat,finish_lon);
if(option_quickest==0)
result2->sortby=result2->score+(score_t)direct/profile->max_pref;
else
result2->sortby=result2->score+(score_t)distance_speed_to_duration(direct,profile->max_speed)/profile->max_pref;
InsertInQueue(queue,result2);
}
}
endloop:
if(!option_quiet && !(results->number%10000))
{
printf("\rRouting: Super-Nodes checked = %d",results->number);
fflush(stdout);
}
segment=NextSegment(segments,segment,node1);
}
}
if(!option_quiet)
{
printf("\rRouting: Super-Nodes checked = %d\n",results->number);
fflush(stdout);
}
/* Finish off the end part of the route. */
if(!FindResult(results,end->finish) && end_prev!=NO_NODE)
{
result2=InsertResult(results,end->finish);
result3=FindResult(end,end->finish);
*result2=*result3;
result2->prev=end_prev;
result2->score=finish_score;
}
FreeQueueList(queue);
/* Check it worked */
if(end_prev==NO_NODE)
{
FreeResultsList(results);
return(NULL);
}
FixForwardRoute(results,end->finish);
return(results);
}
void PrintRoute(Results **results,int nresults,Nodes *nodes,Segments *segments,Ways *ways,Profile *profile)
{
FILE *htmlfile=NULL,*gpxtrackfile=NULL,*gpxroutefile=NULL,*textfile=NULL,*textallfile=NULL;
char *prev_bearing=NULL,*prev_wayname=NULL;
distance_t cum_distance=0;
duration_t cum_duration=0;
int point=1;
int segment_count=0,route_count=0;
int point_count=0;
int roundabout=0;
/* Open the files */
if(option_quickest==0)
{
/* Print the result for the shortest route */
if(option_html)
htmlfile =fopen("shortest.html","w");
if(option_gpx_track)
gpxtrackfile=fopen("shortest-track.gpx","w");
if(option_gpx_route)
gpxroutefile=fopen("shortest-route.gpx","w");
if(option_text)
textfile =fopen("shortest.txt","w");
if(option_text_all)
textallfile =fopen("shortest-all.txt","w");
if(option_html && !htmlfile)
fprintf(stderr,"Warning: Cannot open file 'shortest.html' for writing [%s].\n",strerror(errno));
if(option_gpx_track && !gpxtrackfile)
fprintf(stderr,"Warning: Cannot open file 'shortest-track.gpx' for writing [%s].\n",strerror(errno));
if(option_gpx_route && !gpxroutefile)
fprintf(stderr,"Warning: Cannot open file 'shortest-route.gpx' for writing [%s].\n",strerror(errno));
if(option_text && !textfile)
fprintf(stderr,"Warning: Cannot open file 'shortest.txt' for writing [%s].\n",strerror(errno));
if(option_text_all && !textallfile)
fprintf(stderr,"Warning: Cannot open file 'shortest-all.txt' for writing [%s].\n",strerror(errno));
}
else
{
/* Print the result for the quickest route */
if(option_html)
htmlfile =fopen("quickest.html","w");
if(option_gpx_track)
gpxtrackfile=fopen("quickest-track.gpx","w");
if(option_gpx_route)
gpxroutefile=fopen("quickest-route.gpx","w");
if(option_text)
textfile =fopen("quickest.txt","w");
if(option_text_all)
textallfile =fopen("quickest-all.txt","w");
if(option_html && !htmlfile)
fprintf(stderr,"Warning: Cannot open file 'quickest.html' for writing [%s].\n",strerror(errno));
if(option_gpx_track && !gpxtrackfile)
fprintf(stderr,"Warning: Cannot open file 'quickest-track.gpx' for writing [%s].\n",strerror(errno));
if(option_gpx_route && !gpxroutefile)
fprintf(stderr,"Warning: Cannot open file 'quickest-route.gpx' for writing [%s].\n",strerror(errno));
if(option_text && !textfile)
fprintf(stderr,"Warning: Cannot open file 'quickest.txt' for writing [%s].\n",strerror(errno));
if(option_text_all && !textallfile)
fprintf(stderr,"Warning: Cannot open file 'quickest-all.txt' for writing [%s].\n",strerror(errno));
}
/* Print the head of the files */
if(htmlfile)
{
fprintf(htmlfile,"<!DOCTYPE HTML PUBLIC \"-//W3C//DTD HTML 4.01 Transitional//EN\" \"http://www.w3.org/TR/html4/loose.dtd\">\n");
fprintf(htmlfile,"<HTML>\n");
if(translate_xml_copyright_creator[0] && translate_xml_copyright_creator[1])
fprintf(htmlfile,"<!-- %s : %s -->\n",translate_xml_copyright_creator[0],translate_xml_copyright_creator[1]);
if(translate_xml_copyright_source[0] && translate_xml_copyright_source[1])
fprintf(htmlfile,"<!-- %s : %s -->\n",translate_xml_copyright_source[0],translate_xml_copyright_source[1]);
if(translate_xml_copyright_license[0] && translate_xml_copyright_license[1])
fprintf(htmlfile,"<!-- %s : %s -->\n",translate_xml_copyright_license[0],translate_xml_copyright_license[1]);
fprintf(htmlfile,"<HEAD>\n");
fprintf(htmlfile,"<TITLE>");
fprintf(htmlfile,translate_html_title,option_quickest?translate_xml_route_quickest:translate_xml_route_shortest);
fprintf(htmlfile,"</TITLE>\n");
fprintf(htmlfile,"<META http-equiv=\"Content-Type\" content=\"text/html; charset=UTF-8\">\n");
fprintf(htmlfile,"<STYLE type=\"text/css\">\n");
fprintf(htmlfile,"<!--\n");
fprintf(htmlfile," table {table-layout: fixed; border: none; border-collapse: collapse;}\n");
fprintf(htmlfile," table.c {color: grey; font-size: x-small;} /* copyright */\n");
fprintf(htmlfile," tr {border: 0px;}\n");
fprintf(htmlfile," tr.c {display: none;} /* coords */\n");
fprintf(htmlfile," tr.n {} /* node */\n");
fprintf(htmlfile," tr.s {} /* segment */\n");
fprintf(htmlfile," tr.t {font-weight: bold;} /* total */\n");
fprintf(htmlfile," td.l {font-weight: bold;}\n");
fprintf(htmlfile," td.r {}\n");
fprintf(htmlfile," span.w {font-weight: bold;} /* waypoint */\n");
fprintf(htmlfile," span.h {text-decoration: underline;} /* highway */\n");
fprintf(htmlfile," span.d {} /* segment distance */\n");
fprintf(htmlfile," span.j {font-style: italic;} /* total journey distance */\n");
fprintf(htmlfile," span.t {font-variant: small-caps;} /* turn */\n");
fprintf(htmlfile," span.b {font-variant: small-caps;} /* bearing */\n");
fprintf(htmlfile,"-->\n");
fprintf(htmlfile,"</STYLE>\n");
fprintf(htmlfile,"</HEAD>\n");
fprintf(htmlfile,"<BODY>\n");
fprintf(htmlfile,"<H1>");
fprintf(htmlfile,translate_html_title,option_quickest?translate_xml_route_quickest:translate_xml_route_shortest);
fprintf(htmlfile,"</H1>\n");
fprintf(htmlfile,"<table>\n");
}
if(gpxtrackfile)
{
fprintf(gpxtrackfile,"<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n");
fprintf(gpxtrackfile,"<gpx version=\"1.1\" creator=\"Routino\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xmlns=\"http://www.topografix.com/GPX/1/1\" xsi:schemaLocation=\"http://www.topografix.com/GPX/1/1 http://www.topografix.com/GPX/1/1/gpx.xsd\">\n");
fprintf(gpxtrackfile,"<metadata>\n");
fprintf(gpxtrackfile,"<desc>%s : %s</desc>\n",translate_xml_copyright_creator[0],translate_xml_copyright_creator[1]);
if(translate_xml_copyright_source[1])
{
fprintf(gpxtrackfile,"<copyright author=\"%s\">\n",translate_xml_copyright_source[1]);
if(translate_xml_copyright_license[1])
fprintf(gpxtrackfile,"<license>%s</license>\n",translate_xml_copyright_license[1]);
fprintf(gpxtrackfile,"</copyright>\n");
}
fprintf(gpxtrackfile,"</metadata>\n");
fprintf(gpxtrackfile,"<trk>\n");
fprintf(gpxtrackfile,"<name>");
fprintf(gpxtrackfile,translate_gpx_name,option_quickest?translate_xml_route_quickest:translate_xml_route_shortest);
fprintf(gpxtrackfile,"</name>\n");
fprintf(gpxtrackfile,"<desc>");
fprintf(gpxtrackfile,translate_gpx_desc,option_quickest?translate_xml_route_quickest:translate_xml_route_shortest);
fprintf(gpxtrackfile,"</desc>\n");
}
if(gpxroutefile)
{
fprintf(gpxroutefile,"<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n");
fprintf(gpxroutefile,"<gpx version=\"1.1\" creator=\"Routino\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xmlns=\"http://www.topografix.com/GPX/1/1\" xsi:schemaLocation=\"http://www.topografix.com/GPX/1/1 http://www.topografix.com/GPX/1/1/gpx.xsd\">\n");
fprintf(gpxroutefile,"<metadata>\n");
fprintf(gpxroutefile,"<desc>%s : %s</desc>\n",translate_xml_copyright_creator[0],translate_xml_copyright_creator[1]);
if(translate_xml_copyright_source[1])
{
fprintf(gpxroutefile,"<copyright author=\"%s\">\n",translate_xml_copyright_source[1]);
if(translate_xml_copyright_license[1])
fprintf(gpxroutefile,"<license>%s</license>\n",translate_xml_copyright_license[1]);
fprintf(gpxroutefile,"</copyright>\n");
}
fprintf(gpxroutefile,"</metadata>\n");
fprintf(gpxroutefile,"<rte>\n");
fprintf(gpxroutefile,"<name>");
fprintf(gpxroutefile,translate_gpx_name,option_quickest?translate_xml_route_quickest:translate_xml_route_shortest);
fprintf(gpxroutefile,"</name>\n");
fprintf(gpxroutefile,"<desc>");
fprintf(gpxroutefile,translate_gpx_desc,option_quickest?translate_xml_route_quickest:translate_xml_route_shortest);
fprintf(gpxroutefile,"</desc>\n");
}
if(textfile)
{
if(translate_raw_copyright_creator[0] && translate_raw_copyright_creator[1])
fprintf(textfile,"# %s : %s\n",translate_raw_copyright_creator[0],translate_raw_copyright_creator[1]);
if(translate_raw_copyright_source[0] && translate_raw_copyright_source[1])
fprintf(textfile,"# %s : %s\n",translate_raw_copyright_source[0],translate_raw_copyright_source[1]);
if(translate_raw_copyright_license[0] && translate_raw_copyright_license[1])
fprintf(textfile,"# %s : %s\n",translate_raw_copyright_license[0],translate_raw_copyright_license[1]);
if((translate_raw_copyright_creator[0] && translate_raw_copyright_creator[1]) ||
(translate_raw_copyright_source[0] && translate_raw_copyright_source[1]) ||
(translate_raw_copyright_license[0] && translate_raw_copyright_license[1]))
fprintf(textfile,"#\n");
fprintf(textfile,"#Latitude\tLongitude\tSection \tSection \tTotal \tTotal \tPoint\tTurn\tBearing\tHighway\n");
fprintf(textfile,"# \t \tDistance\tDuration\tDistance\tDuration\tType \t \t \t \n");
/* "%10.6f\t%11.6f\t%6.3f km\t%4.1f min\t%5.1f km\t%4.0f min\t%s\t %+d\t %+d\t%s\n" */
}
if(textallfile)
{
if(translate_raw_copyright_creator[0] && translate_raw_copyright_creator[1])
fprintf(textallfile,"# %s : %s\n",translate_raw_copyright_creator[0],translate_raw_copyright_creator[1]);
if(translate_raw_copyright_source[0] && translate_raw_copyright_source[1])
fprintf(textallfile,"# %s : %s\n",translate_raw_copyright_source[0],translate_raw_copyright_source[1]);
if(translate_raw_copyright_license[0] && translate_raw_copyright_license[1])
fprintf(textallfile,"# %s : %s\n",translate_raw_copyright_license[0],translate_raw_copyright_license[1]);
if((translate_raw_copyright_creator[0] && translate_raw_copyright_creator[1]) ||
(translate_raw_copyright_source[0] && translate_raw_copyright_source[1]) ||
(translate_raw_copyright_license[0] && translate_raw_copyright_license[1]))
fprintf(textallfile,"#\n");
fprintf(textallfile,"#Latitude\tLongitude\t Node\tType\tSegment\tSegment\tTotal\tTotal \tSpeed\tBearing\tHighway\n");
fprintf(textallfile,"# \t \t \t \tDist \tDurat'n\tDist \tDurat'n\t \t \t \n");
/* "%10.6f\t%11.6f\t%8d%c\t%s\t%5.3f\t%5.2f\t%5.2f\t%5.1f\t%3d\t%4d\t%s\n" */
}
/* Loop through all the sections of the route and print them */
while(!results[point])
point++;
while(point<=nresults)
{
int next_point=point;
distance_t junc_distance=0;
duration_t junc_duration=0;
Result *result;
result=FindResult(results[point],results[point]->start_node,results[point]->prev_segment);
/* Print the start of the segment */
if(gpxtrackfile)
fprintf(gpxtrackfile,"<trkseg>\n");
/* Loop through all the points within a section of the route and print them */
do
{
double latitude,longitude;
Node *resultnode=NULL;
index_t realsegment=NO_SEGMENT,next_realsegment=NO_SEGMENT;
Segment *resultsegment=NULL,*next_resultsegment=NULL;
Way *resultway=NULL,*next_resultway=NULL;
Result *next_result;
int important=IMP_UNIMPORTANT;
distance_t seg_distance=0;
duration_t seg_duration=0;
speed_t seg_speed=0;
char *waynameraw=NULL,*wayname=NULL,*next_waynameraw=NULL,*next_wayname=NULL;
int bearing_int=0,turn_int=0,next_bearing_int=0;
char *turn=NULL,*next_bearing=NULL;
/* Calculate the information about this point */
if(IsFakeNode(result->node))
GetFakeLatLong(result->node,&latitude,&longitude);
else
GetLatLong(nodes,result->node,&latitude,&longitude);
if(!IsFakeNode(result->node))
resultnode=LookupNode(nodes,result->node,6);
/* Calculate the next result */
next_result=result->next;
if(!next_result)
for(next_point=point+1; next_point<=nresults; next_point++)
if(results[next_point])
{
next_result=FindResult(results[next_point],results[next_point]->start_node,results[next_point]->prev_segment);
next_result=next_result->next;
break;
}
/* Calculate the information about this segment */
if(result->node!=results[point]->start_node) /* not first point of a section of the route */
{
if(IsFakeSegment(result->segment))
{
resultsegment=LookupFakeSegment(result->segment);
realsegment=IndexRealSegment(result->segment);
}
else
{
resultsegment=LookupSegment(segments,result->segment,2);
realsegment=result->segment;
}
resultway=LookupWay(ways,resultsegment->way,1);
seg_distance+=DISTANCE(resultsegment->distance);
seg_duration+=Duration(resultsegment,resultway,profile);
/* Calculate the cumulative distance/duration */
junc_distance+=seg_distance;
junc_duration+=seg_duration;
cum_distance+=seg_distance;
cum_duration+=seg_duration;
}
/* Calculate the information about the next segment */
if(next_result)
{
if(IsFakeSegment(next_result->segment))
{
next_resultsegment=LookupFakeSegment(next_result->segment);
next_realsegment=IndexRealSegment(next_result->segment);
}
else
{
next_resultsegment=LookupSegment(segments,next_result->segment,1);
next_realsegment=next_result->segment;
}
}
/* Decide if this is a roundabout */
if(next_result)
{
next_resultway=LookupWay(ways,next_resultsegment->way,2);
if(next_resultway->type&Way_Roundabout)
{
if(roundabout==0)
{
roundabout++;
important=IMP_RB_ENTRY;
}
else
{
Segment *segment=FirstSegment(segments,resultnode,3);
do
{
index_t othernode=OtherNode(segment,result->node);
if(othernode!=result->prev->node && IndexSegment(segments,segment)!=realsegment)
if(IsNormalSegment(segment) && (!profile->oneway || !IsOnewayTo(segment,result->node)))
{
Way *way=LookupWay(ways,segment->way,3);
if(!(way->type&Way_Roundabout))
if(othernode!=next_result->node)
{
roundabout++;
important=IMP_RB_NOT_EXIT;
}
}
segment=NextSegment(segments,segment,result->node);
}
while(segment);
}
}
else if(roundabout)
{
roundabout++;
important=IMP_RB_EXIT;
}
}
/* Decide if this is an important junction */
if(roundabout) /* roundabout */
;
else if(point_count==0) /* first point overall = Waypoint */
important=IMP_WAYPOINT;
else if(result->node==results[point]->finish_node) /* Waypoint */
important=IMP_WAYPOINT;
else if(result->node==results[point]->start_node) /* first point of a section of the route */
important=IMP_IGNORE;
else if(realsegment==next_realsegment) /* U-turn */
important=IMP_UTURN;
else if(resultnode && (resultnode->flags&NODE_MINIRNDBT))
important=IMP_MINI_RB; /* mini-roundabout */
else
{
Segment *segment=FirstSegment(segments,resultnode,3);
do
{
index_t othernode=OtherNode(segment,result->node);
if(othernode!=result->prev->node && IndexSegment(segments,segment)!=realsegment)
if(IsNormalSegment(segment) && (!profile->oneway || !IsOnewayTo(segment,result->node)))
{
Way *way=LookupWay(ways,segment->way,3);
if(othernode==next_result->node) /* the next segment that we follow */
{
if(HIGHWAY(way->type)!=HIGHWAY(resultway->type))
if(important<IMP_CHANGE)
important=IMP_CHANGE;
}
else if(IsFakeNode(next_result->node))
;
else /* a segment that we don't follow */
{
if(junction_other_way[HIGHWAY(resultway->type)-1][HIGHWAY(way->type)-1])
if(important<IMP_JUNCT_IMPORT)
important=IMP_JUNCT_IMPORT;
if(important<IMP_JUNCT_CONT)
important=IMP_JUNCT_CONT;
}
}
segment=NextSegment(segments,segment,result->node);
}
while(segment);
}
/* Calculate the strings to be used */
if(resultway && textallfile)
{
waynameraw=WayName(ways,resultway);
if(!*waynameraw)
waynameraw=translate_raw_highway[HIGHWAY(resultway->type)];
bearing_int=(int)BearingAngle(nodes,resultsegment,result->node);
seg_speed=profile->speed[HIGHWAY(resultway->type)];
}
if(next_result && important>IMP_JUNCT_CONT)
{
if(resultsegment && (htmlfile || textfile))
{
turn_int=(int)TurnAngle(nodes,resultsegment,next_resultsegment,result->node);
turn=translate_xml_turn[((202+turn_int)/45)%8];
}
if(gpxroutefile || htmlfile)
{
next_waynameraw=WayName(ways,next_resultway);
if(!*next_waynameraw)
next_waynameraw=translate_raw_highway[HIGHWAY(next_resultway->type)];
next_wayname=ParseXML_Encode_Safe_XML(next_waynameraw);
}
if(htmlfile || gpxroutefile || textfile)
{
next_bearing_int=(int)BearingAngle(nodes,next_resultsegment,next_result->node);
next_bearing=translate_xml_heading[(4+(22+next_bearing_int)/45)%8];
}
}
/* Print out the important points (junctions / waypoints) */
if(important>IMP_JUNCT_CONT)
{
if(htmlfile)
{
char *type;
if(important==IMP_WAYPOINT)
type=translate_html_waypoint;
else if(important==IMP_MINI_RB)
type=translate_html_roundabout;
else
type=translate_html_junction;
if(point_count>0) /* not the first point */
{
/* <tr class='s'><td class='l'>Follow:<td class='r'><span class='h'>*highway name*</span> for <span class='d'>*distance* km, *time* min</span> [<span class='j'>*distance* km, *time* minutes</span>] */
fprintf(htmlfile,"<tr class='s'><td class='l'>%s:<td class='r'>",translate_html_segment[0]);
fprintf(htmlfile,translate_html_segment[1],
(roundabout>1?translate_html_roundabout:prev_wayname),
distance_to_km(junc_distance),duration_to_minutes(junc_duration));
fprintf(htmlfile," [<span class='j'>");
fprintf(htmlfile,translate_html_total[1],
distance_to_km(cum_distance),duration_to_minutes(cum_duration));
fprintf(htmlfile,"</span>]\n");
}
/* <tr class='c'><td class='l'>*N*:<td class='r'>*latitude* *longitude* */
fprintf(htmlfile,"<tr class='c'><td class='l'>%d:<td class='r'>%.6f %.6f\n",
point_count+1,
radians_to_degrees(latitude),radians_to_degrees(longitude));
if(point_count==0) /* first point */
{
/* <tr class='n'><td class='l'>Start:<td class='r'>At <span class='w'>Waypoint</span>, head <span class='b'>*heading*</span> */
fprintf(htmlfile,"<tr class='n'><td class='l'>%s:<td class='r'>",translate_html_start[0]);
fprintf(htmlfile,translate_html_start[1],
translate_html_waypoint,
next_bearing);
fprintf(htmlfile,"\n");
}
else if(next_result) /* middle point */
{
if(roundabout>1)
{
/* <tr class='n'><td class='l'>At:<td class='r'>Roundabout, take <span class='t'>the *Nth* exit</span> heading <span class='b'>*heading*</span> */
fprintf(htmlfile,"<tr class='n'><td class='l'>%s:<td class='r'>",translate_html_rbnode[0]);
fprintf(htmlfile,translate_html_rbnode[1],
translate_html_roundabout,
translate_xml_ordinal[roundabout-2],
next_bearing);
fprintf(htmlfile,"\n");
}
else
{
/* <tr class='n'><td class='l'>At:<td class='r'>Junction, go <span class='t'>*direction*</span> heading <span class='b'>*heading*</span> */
fprintf(htmlfile,"<tr class='n'><td class='l'>%s:<td class='r'>",translate_html_node[0]);
fprintf(htmlfile,translate_html_node[1],
type,
turn,
next_bearing);
fprintf(htmlfile,"\n");
}
}
else /* end point */
{
/* <tr class='n'><td class='l'>Stop:<td class='r'>At <span class='w'>Waypoint</span> */
fprintf(htmlfile,"<tr class='n'><td class='l'>%s:<td class='r'>",translate_html_stop[0]);
fprintf(htmlfile,translate_html_stop[1],
translate_html_waypoint);
fprintf(htmlfile,"\n");
/* <tr class='t'><td class='l'>Total:<td class='r'><span class='j'>*distance* km, *time* minutes</span> */
fprintf(htmlfile,"<tr class='t'><td class='l'>%s:<td class='r'><span class='j'>",translate_html_total[0]);
fprintf(htmlfile,translate_html_total[1],
distance_to_km(cum_distance),duration_to_minutes(cum_duration));
fprintf(htmlfile,"</span>\n");
}
}
if(gpxroutefile)
{
if(point_count>0) /* not first point */
{
fprintf(gpxroutefile,"<desc>");
fprintf(gpxroutefile,translate_gpx_step,
prev_bearing,
prev_wayname,
distance_to_km(junc_distance),duration_to_minutes(junc_duration));
fprintf(gpxroutefile,"</desc></rtept>\n");
}
if(point_count==0) /* first point */
{
fprintf(gpxroutefile,"<rtept lat=\"%.6f\" lon=\"%.6f\"><name>%s</name>\n",
radians_to_degrees(latitude),radians_to_degrees(longitude),
translate_gpx_start);
}
else if(!next_result) /* end point */
{
fprintf(gpxroutefile,"<rtept lat=\"%.6f\" lon=\"%.6f\"><name>%s</name>\n",
radians_to_degrees(latitude),radians_to_degrees(longitude),
translate_gpx_finish);
fprintf(gpxroutefile,"<desc>");
fprintf(gpxroutefile,translate_gpx_final,
distance_to_km(cum_distance),duration_to_minutes(cum_duration));
fprintf(gpxroutefile,"</desc></rtept>\n");
}
else /* middle point */
{
if(important==IMP_WAYPOINT)
fprintf(gpxroutefile,"<rtept lat=\"%.6f\" lon=\"%.6f\"><name>%s%d</name>\n",
radians_to_degrees(latitude),radians_to_degrees(longitude),
translate_gpx_inter,++segment_count);
else
fprintf(gpxroutefile,"<rtept lat=\"%.6f\" lon=\"%.6f\"><name>%s%03d</name>\n",
radians_to_degrees(latitude),radians_to_degrees(longitude),
translate_gpx_trip,++route_count);
}
}
if(textfile)
{
char *type;
if(important==IMP_WAYPOINT)
type="Waypt";
else
type="Junct";
if(point_count==0) /* first point */
{
fprintf(textfile,"%10.6f\t%11.6f\t%6.3f km\t%4.1f min\t%5.1f km\t%4.0f min\t%s\t\t %+d\t%s\n",
radians_to_degrees(latitude),radians_to_degrees(longitude),
0.0,0.0,0.0,0.0,
type,
((22+next_bearing_int)/45+4)%8-4,
next_waynameraw);
}
else if(!next_result) /* end point */
{
fprintf(textfile,"%10.6f\t%11.6f\t%6.3f km\t%4.1f min\t%5.1f km\t%4.0f min\t%s\t\t\t\n",
radians_to_degrees(latitude),radians_to_degrees(longitude),
distance_to_km(junc_distance),duration_to_minutes(junc_duration),
distance_to_km(cum_distance),duration_to_minutes(cum_duration),
type);
}
else /* middle point */
{
fprintf(textfile,"%10.6f\t%11.6f\t%6.3f km\t%4.1f min\t%5.1f km\t%4.0f min\t%s\t %+d\t %+d\t%s\n",
radians_to_degrees(latitude),radians_to_degrees(longitude),
distance_to_km(junc_distance),duration_to_minutes(junc_duration),
distance_to_km(cum_distance),duration_to_minutes(cum_duration),
type,
(22+turn_int)/45,
((22+next_bearing_int)/45+4)%8-4,
next_waynameraw);
}
}
junc_distance=0;
junc_duration=0;
if(htmlfile || gpxroutefile)
{
if(prev_wayname)
free(prev_wayname);
if(next_wayname)
prev_wayname=strcpy((char*)malloc(strlen(next_wayname)+1),next_wayname);
else
prev_wayname=NULL;
if(next_wayname && next_wayname!=next_waynameraw)
free(next_wayname);
}
if(gpxroutefile)
prev_bearing=next_bearing;
if(roundabout>1)
roundabout=0;
}
/* Print out all of the results */
if(gpxtrackfile)
fprintf(gpxtrackfile,"<trkpt lat=\"%.6f\" lon=\"%.6f\"/>\n",
radians_to_degrees(latitude),radians_to_degrees(longitude));
if(important>IMP_IGNORE)
{
if(textallfile)
{
char *type;
if(important==IMP_WAYPOINT)
type="Waypt";
else if(important==IMP_UTURN)
type="U-turn";
else if(important==IMP_MINI_RB)
type="Mini-RB";
else if(important==IMP_CHANGE)
type="Change";
else if(important==IMP_UNIMPORTANT)
type="Inter";
else
type="Junct";
if(point_count==0) /* first point */
{
fprintf(textallfile,"%10.6f\t%11.6f\t%8d%c\t%s\t%5.3f\t%5.2f\t%5.2f\t%5.1f\t\t\t\n",
radians_to_degrees(latitude),radians_to_degrees(longitude),
IsFakeNode(result->node)?(NODE_FAKE-result->node):result->node,
(resultnode && IsSuperNode(resultnode))?'*':' ',type,
0.0,0.0,0.0,0.0);
}
else /* not the first point */
{
fprintf(textallfile,"%10.6f\t%11.6f\t%8d%c\t%s\t%5.3f\t%5.2f\t%5.2f\t%5.1f\t%3d\t%4d\t%s\n",
radians_to_degrees(latitude),radians_to_degrees(longitude),
IsFakeNode(result->node)?(NODE_FAKE-result->node):result->node,
(resultnode && IsSuperNode(resultnode))?'*':' ',type,
distance_to_km(seg_distance),duration_to_minutes(seg_duration),
distance_to_km(cum_distance),duration_to_minutes(cum_duration),
speed_to_kph(seg_speed),
bearing_int,
waynameraw);
}
}
}
if(wayname && wayname!=waynameraw)
free(wayname);
result=next_result;
if(important>IMP_JUNCT_CONT)
point_count++;
}
while(point==next_point);
/* Print the end of the segment */
if(gpxtrackfile)
fprintf(gpxtrackfile,"</trkseg>\n");
point=next_point;
}
/* Print the tail of the files */
if(htmlfile)
{
fprintf(htmlfile,"</table>\n");
if((translate_xml_copyright_creator[0] && translate_xml_copyright_creator[1]) ||
(translate_xml_copyright_source[0] && translate_xml_copyright_source[1]) ||
(translate_xml_copyright_license[0] && translate_xml_copyright_license[1]))
{
fprintf(htmlfile,"<p>\n");
fprintf(htmlfile,"<table class='c'>\n");
if(translate_xml_copyright_creator[0] && translate_xml_copyright_creator[1])
fprintf(htmlfile,"<tr><td class='l'>%s:<td class='r'>%s\n",translate_xml_copyright_creator[0],translate_xml_copyright_creator[1]);
if(translate_xml_copyright_source[0] && translate_xml_copyright_source[1])
fprintf(htmlfile,"<tr><td class='l'>%s:<td class='r'>%s\n",translate_xml_copyright_source[0],translate_xml_copyright_source[1]);
if(translate_xml_copyright_license[0] && translate_xml_copyright_license[1])
fprintf(htmlfile,"<tr><td class='l'>%s:<td class='r'>%s\n",translate_xml_copyright_license[0],translate_xml_copyright_license[1]);
fprintf(htmlfile,"</table>\n");
}
fprintf(htmlfile,"</BODY>\n");
fprintf(htmlfile,"</HTML>\n");
}
if(gpxtrackfile)
{
fprintf(gpxtrackfile,"</trk>\n");
fprintf(gpxtrackfile,"</gpx>\n");
}
if(gpxroutefile)
{
fprintf(gpxroutefile,"</rte>\n");
fprintf(gpxroutefile,"</gpx>\n");
}
/* Close the files */
if(htmlfile)
fclose(htmlfile);
if(gpxtrackfile)
fclose(gpxtrackfile);
if(gpxroutefile)
fclose(gpxroutefile);
if(textfile)
fclose(textfile);
if(textallfile)
fclose(textallfile);
}
Results *FindNormalRoute(Nodes *nodes,Segments *segments,Ways *ways,Relations *relations,Profile *profile,index_t start_node,index_t prev_segment,index_t finish_node)
{
Results *results;
Queue *queue;
score_t finish_score;
double finish_lat,finish_lon;
Result *finish_result;
Result *result1,*result2;
/* Set up the finish conditions */
finish_score=INF_SCORE;
finish_result=NULL;
if(IsFakeNode(finish_node))
GetFakeLatLong(finish_node,&finish_lat,&finish_lon);
else
GetLatLong(nodes,finish_node,&finish_lat,&finish_lon);
/* Create the list of results and insert the first node into the queue */
results=NewResultsList(64);
results->start_node=start_node;
results->prev_segment=prev_segment;
result1=InsertResult(results,results->start_node,results->prev_segment);
queue=NewQueueList();
InsertInQueue(queue,result1);
/* Loop across all nodes in the queue */
while((result1=PopFromQueue(queue)))
{
Segment *segment;
index_t node1,seg1,seg1r;
index_t turnrelation=NO_RELATION;
/* score must be better than current best score */
if(result1->score>finish_score)
continue;
node1=result1->node;
seg1=result1->segment;
if(IsFakeSegment(seg1))
seg1r=IndexRealSegment(seg1);
else
seg1r=seg1;
/* lookup if a turn restriction applies */
if(profile->turns && !IsFakeNode(node1) && IsTurnRestrictedNode(LookupNode(nodes,node1,1)))
turnrelation=FindFirstTurnRelation2(relations,node1,seg1r);
/* Loop across all segments */
if(IsFakeNode(node1))
segment=FirstFakeSegment(node1);
else
segment=FirstSegment(segments,nodes,node1,1);
while(segment)
{
Way *way;
index_t node2,seg2,seg2r;
score_t segment_pref,segment_score,cumulative_score;
int i;
node2=OtherNode(segment,node1); /* need this here because we use node2 at the end of the loop */
/* must be a normal segment */
if(!IsNormalSegment(segment))
goto endloop;
/* must obey one-way restrictions (unless profile allows) */
if(profile->oneway && IsOnewayTo(segment,node1))
goto endloop;
if(IsFakeNode(node1) || IsFakeNode(node2))
{
seg2 =IndexFakeSegment(segment);
seg2r=IndexRealSegment(seg2);
}
else
{
seg2 =IndexSegment(segments,segment);
seg2r=seg2;
}
/* must not perform U-turn (unless profile allows) */
if(profile->turns && (seg1==seg2 || seg1==seg2r || seg1r==seg2 || (seg1r==seg2r && IsFakeUTurn(seg1,seg2))))
goto endloop;
/* must obey turn relations */
if(turnrelation!=NO_RELATION && !IsTurnAllowed(relations,turnrelation,node1,seg1r,seg2r,profile->allow))
goto endloop;
/* must not pass over super-node */
if(node2!=finish_node && !IsFakeNode(node2) && IsSuperNode(LookupNode(nodes,node2,2)))
goto endloop;
way=LookupWay(ways,segment->way,1);
/* mode of transport must be allowed on the highway */
if(!(way->allow&profile->allow))
goto endloop;
/* must obey weight restriction (if exists) */
if(way->weight && way->weight<profile->weight)
goto endloop;
/* must obey height/width/length restriction (if exists) */
if((way->height && way->height<profile->height) ||
(way->width && way->width <profile->width ) ||
(way->length && way->length<profile->length))
goto endloop;
segment_pref=profile->highway[HIGHWAY(way->type)];
for(i=1;i<Property_Count;i++)
if(ways->file.props & PROPERTIES(i))
{
if(way->props & PROPERTIES(i))
segment_pref*=profile->props_yes[i];
else
segment_pref*=profile->props_no[i];
}
/* profile preferences must allow this highway */
if(segment_pref==0)
goto endloop;
/* mode of transport must be allowed through node2 */
if(!IsFakeNode(node2))
{
Node *node=LookupNode(nodes,node2,2);
if(!(node->allow&profile->allow))
goto endloop;
}
if(option_quickest==0)
segment_score=(score_t)DISTANCE(segment->distance)/segment_pref;
else
segment_score=(score_t)Duration(segment,way,profile)/segment_pref;
cumulative_score=result1->score+segment_score;
/* score must be better than current best score */
if(cumulative_score>finish_score)
goto endloop;
result2=FindResult(results,node2,seg2);
if(!result2) /* New end node/segment combination */
{
result2=InsertResult(results,node2,seg2);
result2->prev=result1;
result2->score=cumulative_score;
if(node2==finish_node)
{
if(cumulative_score<finish_score)
{
finish_score=cumulative_score;
finish_result=result2;
}
}
else
{
result2->sortby=result2->score;
InsertInQueue(queue,result2);
}
}
else if(cumulative_score<result2->score) /* New score for end node/segment combination is better */
{
result2->prev=result1;
result2->score=cumulative_score;
result2->segment=seg2;
if(node2==finish_node)
{
if(cumulative_score<finish_score)
{
finish_score=cumulative_score;
finish_result=result2;
}
}
else
{
result2->sortby=result2->score;
if(result2->score<finish_score)
InsertInQueue(queue,result2);
}
}
endloop:
if(IsFakeNode(node1))
segment=NextFakeSegment(segment,node1);
else if(IsFakeNode(node2))
segment=NULL; /* cannot call NextSegment() with a fake segment */
else
{
segment=NextSegment(segments,segment,node1);
if(!segment && IsFakeNode(finish_node))
segment=ExtraFakeSegment(node1,finish_node);
}
}
}
FreeQueueList(queue);
/* Check it worked */
if(!finish_result)
{
FreeResultsList(results);
return(NULL);
}
FixForwardRoute(results,finish_result);
return(results);
}
Results *FindMiddleRoute(Nodes *nodes,Segments *segments,Ways *ways,Relations *relations,Profile *profile,Results *begin,Results *end)
{
Results *results;
Queue *queue;
Result *finish_result;
score_t finish_score;
double finish_lat,finish_lon;
Result *result1,*result2,*result3,*result4;
if(!option_quiet)
printf_first("Routing: Super-Nodes checked = 0");
/* Set up the finish conditions */
finish_score=INF_DISTANCE;
finish_result=NULL;
if(IsFakeNode(end->finish_node))
GetFakeLatLong(end->finish_node,&finish_lat,&finish_lon);
else
GetLatLong(nodes,end->finish_node,&finish_lat,&finish_lon);
/* Create the list of results and insert the first node into the queue */
results=NewResultsList(65536);
results->start_node=begin->start_node;
results->prev_segment=begin->prev_segment;
if(begin->number==1)
{
if(begin->prev_segment==NO_SEGMENT)
results->prev_segment=NO_SEGMENT;
else
{
index_t superseg=FindSuperSegment(nodes,segments,ways,relations,profile,begin->start_node,begin->prev_segment);
results->prev_segment=superseg;
}
}
result1=InsertResult(results,results->start_node,results->prev_segment);
queue=NewQueueList();
/* Insert the finish points of the beginning part of the path into the queue,
translating the segments into super-segments. */
result3=FirstResult(begin);
while(result3)
{
if((results->start_node!=result3->node || results->prev_segment!=result3->segment) &&
!IsFakeNode(result3->node) && IsSuperNode(LookupNode(nodes,result3->node,1)))
{
Result *result5=result1;
index_t superseg=FindSuperSegment(nodes,segments,ways,relations,profile,result3->node,result3->segment);
if(superseg!=result3->segment)
{
result5=InsertResult(results,result3->node,result3->segment);
result5->prev=result1;
}
if(!FindResult(results,result3->node,superseg))
{
result2=InsertResult(results,result3->node,superseg);
result2->prev=result5;
result2->score=result3->score;
result2->sortby=result3->score;
InsertInQueue(queue,result2);
if((result4=FindResult(end,result2->node,result2->segment)))
{
if((result2->score+result4->score)<finish_score)
{
finish_score=result2->score+result4->score;
finish_result=result2;
}
}
}
}
result3=NextResult(begin,result3);
}
if(begin->number==1)
InsertInQueue(queue,result1);
/* Loop across all nodes in the queue */
while((result1=PopFromQueue(queue)))
{
index_t node1,seg1;
Segment *segment;
index_t turnrelation=NO_RELATION;
/* score must be better than current best score */
if(result1->score>finish_score)
continue;
node1=result1->node;
seg1=result1->segment;
/* lookup if a turn restriction applies */
if(profile->turns && IsTurnRestrictedNode(LookupNode(nodes,node1,1))) /* node1 cannot be a fake node (must be a super-node) */
turnrelation=FindFirstTurnRelation2(relations,node1,seg1);
/* Loop across all segments */
segment=FirstSegment(segments,nodes,node1,1); /* node1 cannot be a fake node (must be a super-node) */
while(segment)
{
Way *way;
Node *node;
index_t node2,seg2;
score_t segment_pref,segment_score,cumulative_score;
int i;
/* must be a super segment */
if(!IsSuperSegment(segment))
goto endloop;
/* must obey one-way restrictions (unless profile allows) */
if(profile->oneway && IsOnewayTo(segment,node1))
goto endloop;
node2=OtherNode(segment,node1);
seg2=IndexSegment(segments,segment); /* node2 cannot be a fake node (must be a super-node) */
/* must not perform U-turn */
if(seg1==seg2) /* No fake segments, applies to all profiles */
goto endloop;
/* must obey turn relations */
if(turnrelation!=NO_RELATION && !IsTurnAllowed(relations,turnrelation,node1,seg1,seg2,profile->allow))
goto endloop;
way=LookupWay(ways,segment->way,1);
/* transport must be allowed on the highway */
if(!(way->allow&profile->allow))
goto endloop;
/* must obey weight restriction (if exists) */
if(way->weight && way->weight<profile->weight)
goto endloop;
/* must obey height/width/length restriction (if exists) */
if((way->height && way->height<profile->height) ||
(way->width && way->width <profile->width ) ||
(way->length && way->length<profile->length))
goto endloop;
segment_pref=profile->highway[HIGHWAY(way->type)];
for(i=1;i<Property_Count;i++)
if(ways->file.props & PROPERTIES(i))
{
if(way->props & PROPERTIES(i))
segment_pref*=profile->props_yes[i];
else
segment_pref*=profile->props_no[i];
}
/* profile preferences must allow this highway */
if(segment_pref==0)
goto endloop;
node=LookupNode(nodes,node2,2); /* node2 cannot be a fake node (must be a super-node) */
/* mode of transport must be allowed through node2 */
if(!(node->allow&profile->allow))
goto endloop;
if(option_quickest==0)
segment_score=(score_t)DISTANCE(segment->distance)/segment_pref;
else
segment_score=(score_t)Duration(segment,way,profile)/segment_pref;
cumulative_score=result1->score+segment_score;
/* score must be better than current best score */
if(cumulative_score>finish_score)
goto endloop;
result2=FindResult(results,node2,seg2);
if(!result2) /* New end node/segment pair */
{
result2=InsertResult(results,node2,seg2);
result2->prev=result1;
result2->score=cumulative_score;
if((result3=FindResult(end,node2,seg2)))
{
if((result2->score+result3->score)<finish_score)
{
finish_score=result2->score+result3->score;
finish_result=result2;
}
}
else
{
double lat,lon;
distance_t direct;
GetLatLong(nodes,node2,&lat,&lon); /* node2 cannot be a fake node (must be a super-node) */
direct=Distance(lat,lon,finish_lat,finish_lon);
if(option_quickest==0)
result2->sortby=result2->score+(score_t)direct/profile->max_pref;
else
result2->sortby=result2->score+(score_t)distance_speed_to_duration(direct,profile->max_speed)/profile->max_pref;
InsertInQueue(queue,result2);
}
}
else if(cumulative_score<result2->score) /* New end node/segment pair is better */
{
result2->prev=result1;
result2->score=cumulative_score;
if((result3=FindResult(end,node2,seg2)))
{
if((result2->score+result3->score)<finish_score)
{
finish_score=result2->score+result3->score;
finish_result=result2;
}
}
else if(result2->score<finish_score)
{
double lat,lon;
distance_t direct;
GetLatLong(nodes,node2,&lat,&lon); /* node2 cannot be a fake node (must be a super-node) */
direct=Distance(lat,lon,finish_lat,finish_lon);
if(option_quickest==0)
result2->sortby=result2->score+(score_t)direct/profile->max_pref;
else
result2->sortby=result2->score+(score_t)distance_speed_to_duration(direct,profile->max_speed)/profile->max_pref;
InsertInQueue(queue,result2);
}
}
if(!option_quiet && !(results->number%1000))
printf_middle("Routing: Super-Nodes checked = %d",results->number);
endloop:
segment=NextSegment(segments,segment,node1); /* node1 cannot be a fake node (must be a super-node) */
}
}
if(!option_quiet)
printf_last("Routing: Super-Nodes checked = %d",results->number);
FreeQueueList(queue);
/* Check it worked */
if(!finish_result)
{
FreeResultsList(results);
return(NULL);
}
/* Finish off the end part of the route */
if(finish_result->node!=end->finish_node)
{
result3=InsertResult(results,end->finish_node,NO_SEGMENT);
result3->prev=finish_result;
result3->score=finish_score;
finish_result=result3;
}
FixForwardRoute(results,finish_result);
return(results);
}
