duration_t Duration(Segment *segmentp,Way *wayp,Profile *profile)
{
speed_t speed1=wayp->speed;
speed_t speed2=profile->speed[HIGHWAY(wayp->type)];
distance_t distance=DISTANCE(segmentp->distance);
if(speed1==0)
{
if(speed2==0)
return(hours_to_duration(10));
else
return distance_speed_to_duration(distance,speed2);
}
else /* if(speed1!=0) */
{
if(speed2==0)
return distance_speed_to_duration(distance,speed1);
else if(speed1<=speed2)
return distance_speed_to_duration(distance,speed1);
else
return distance_speed_to_duration(distance,speed2);
}
}
duration_t Duration(index_t node, Segment *segmentp,Way *wayp,Profile *profile,speed_t *pspeedresult)
{
speed_t speed1=wayp->speed;
speed_t speed2=profile->speed[HIGHWAY(wayp->type)];
speed_t speedcalc;
distance_t distance=DISTANCE(segmentp->distance);
if(speed1==0)
{
if(speed2==0)
return(hours_to_duration(10));
else
*pspeedresult=speed2;
}
else /* if(speed1!=0) */
{
if(speed2==0)
*pspeedresult=speed1;
else if(speed1<=speed2)
*pspeedresult=speed1;
else
*pspeedresult=speed2;
}
if (profile->allow != Transports_Bicycle || (wayp->incline == 0 && segmentp->percentascent == 0 && segmentp->percentdescent == 0))
return distance_speed_to_duration(distance,*pspeedresult);
#if DEBUG
printf(" incline=%d node=%"Pindex_t" seg->node1=%"Pindex_t" seg->node2=%"Pindex_t" percentascent=%f percentdescent=%f distx=%08x\n",wayp->incline,node,segmentp->node1,segmentp->node2,segmentp->percentascent,segmentp->percentdescent,segmentp->descent,segmentp->distance );
#endif
if (wayp->incline != 0)
{
if (segmentp->node1 == node && segmentp->distance & INCLINEUP_2TO1)
return distance_speed_to_duration(distance,*pspeedresult);
if (segmentp->node2 == node && segmentp->distance & INCLINEUP_1TO2)
return distance_speed_to_duration(distance,*pspeedresult);
if (abs(wayp->incline) < 50)
return distance_speed_to_duration(distance,*pspeedresult);
if (abs(wayp->incline) < 100)
speedcalc = 20 - abs(wayp->incline)/10;
else
if (abs(wayp->incline) < 160)
speedcalc = 18 - abs(wayp->incline)/10;
else
speedcalc = 2;
#if DEBUG
printf("Duration incline=%d speedcalc=%d result=%d\n",wayp->incline,speedcalc,*pspeedresult );
#endif
}
else
{
float percent=0;
if (segmentp->node1 == node && segmentp->percentascent > 0)
percent = segmentp->percentascent - segmentp->percentdescent;
if (segmentp->node2 == node && segmentp->percentdescent > 0)
percent = segmentp->percentdescent - segmentp->percentascent;
if(percent < 5)
return distance_speed_to_duration(distance,*pspeedresult);
if(percent < 10)
speedcalc = 20 - percent;
if(percent < 16)
speedcalc = 18 - percent;
else
speedcalc = 2;
#if DEBUG
printf("Duration percent: %0.2f speedcalc=%d result=%d\n",percent,speedcalc,*pspeedresult );
#endif
}
if (speedcalc < *pspeedresult) *pspeedresult=speedcalc;
return distance_speed_to_duration(distance,*pspeedresult);
}
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);
}
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);
}
