trunk/src/supersegments.c

/***************************************
 $Header: /home/amb/CVS/routino/src/supersegments.c,v 1.3 2009-01-11 09:28:31 amb Exp $

 Super-Segment data type functions.
 ******************/ /******************
 Written by Andrew M. Bishop

 This file Copyright 2008,2009 Andrew M. Bishop
 It may be distributed under the GNU Public License, version 2, or
 any higher version.  See section COPYING of the GNU Public license
 for conditions under which this file may be redistributed.
 ***************************************/


#include <assert.h>
#include <math.h>
#include <stdlib.h>

#include "nodes.h"
#include "ways.h"
#include "segments.h"
#include "functions.h"


/*++++++++++++++++++++++++++++++++++++++
  Select the super-segments from the list of segments.

  NodesMem *ChooseJunctions Returns the list of junctions.

  Nodes *nodes The nodes.

  Segments *segments The existing segments.

  Ways *ways The ways.
  ++++++++++++++++++++++++++++++++++++++*/

NodesMem *ChooseJunctions(Nodes *nodes,Segments *segments,Ways *ways)
{
 int i;
 int count_oneway=0,count_twoway=0;
 node_t node=0;
 NodesMem *junctions;

 /* Find junctions */

 junctions=NewNodeList();

 for(i=0;i<segments->number;i++)
   {
    Way *way;

    if(i>0 && segments->segments[i].node1!=node)
      {
       if((count_oneway*2+count_twoway)>2)
         {
          Node *oldnode=FindNode(nodes,node);

          AppendNode(junctions,node,oldnode->latitude,oldnode->longitude);
         }

       count_oneway=0;
       count_twoway=0;
      }

    way=FindWay(ways,segments->segments[i].way);

    if(way->type&Way_ONEWAY)
       count_oneway++;
    else
       count_twoway++;

    node=segments->segments[i].node1;

    if(!(i%10000))
      {
       printf("\rFinding Junctions: Segments=%d Junctions=%d",i,junctions->number);
       fflush(stdout);
      }
   }

 printf("\rFound Junctions: Segments=%d Junctions=%d  \n",segments->number,junctions->number);
 fflush(stdout);

 return(junctions);
}


/*++++++++++++++++++++++++++++++++++++++
  Create the super-segments.

  SegmentsMem *CreateSuperSegments Returns the set of super-segments.

  Nodes *nodes The list of nodes.

  Segments *segments The list of segments.

  Ways *ways The list of ways.

  Nodes *junctions The list of junctions.
  ++++++++++++++++++++++++++++++++++++++*/

SegmentsMem *CreateSuperSegments(Nodes *nodes,Segments *segments,Ways *ways,Nodes *junctions)
{
 SegmentsMem *supersegments;
 int i,j,k;

 /* Create super-segments */

 supersegments=NewSegmentList();

 for(i=0;i<junctions->number;i++)
   {
    Results *results;

    results=FindRoutes(nodes,segments,junctions->nodes[i].id,junctions);

    for(j=0;j<NBINS_RESULTS;j++)
       for(k=0;k<results->number[j];k++)
          if(FindNode(junctions,results->results[j][k]->node))
            {
             distance_t distance;
             duration_t duration;
             Segment *segment=AppendSegment(supersegments,junctions->nodes[i].id,results->results[j][k]->node,0);

             distance=results->results[j][k]->shortest.distance;
             duration=results->results[j][k]->quickest.duration;

             if(distance>(distance_short_t)~0)
               {
                fprintf(stderr,"\nSuper-Segment too long (%d->%d) = %.1f km\n",segment->node1,segment->node2,distance_to_km(distance));
                distance=(distance_short_t)~0;
               }

             if(duration>(duration_short_t)~0)
               {
                fprintf(stderr,"\nSuper-Segment too long (%d->%d) = %.1f mins\n",segment->node1,segment->node2,duration_to_minutes(duration));
                duration=(duration_short_t)~0;
               }

             segment->distance=distance;
             segment->duration=duration;
            }

    FreeResultsList(results);

    if(!(i%1000))
      {
       printf("\rFinding Super-Segments: Junctions=%d Super-Segments=%d",i,supersegments->number);
       fflush(stdout);
      }
   }

 printf("\rFound Super-Segments: Junctions=%d Super-Segments=%d  \n",junctions->number,supersegments->number);
 fflush(stdout);

 return(supersegments);
}
1	amb	16	/***************************************
2	amb	31	$Header: /home/amb/CVS/routino/src/supersegments.c,v 1.3 2009-01-11 09:28:31 amb Exp $
3	amb	16
4			Super-Segment data type functions.
5			****************/ /****************
6			Written by Andrew M. Bishop
7
8			This file Copyright 2008,2009 Andrew M. Bishop
9			It may be distributed under the GNU Public License, version 2, or
10			any higher version. See section COPYING of the GNU Public license
11			for conditions under which this file may be redistributed.
12			***************************************/
13
14
15			#include <assert.h>
16			#include <math.h>
17			#include <stdlib.h>
18
19	amb	26	#include "nodes.h"
20			#include "ways.h"
21			#include "segments.h"
22	amb	16	#include "functions.h"
23
24
25			/*++++++++++++++++++++++++++++++++++++++
26			Select the super-segments from the list of segments.
27
28	amb	31	NodesMem *ChooseJunctions Returns the list of junctions.
29	amb	16
30	amb	26	Nodes *nodes The nodes.
31	amb	16
32	amb	26	Segments *segments The existing segments.
33	amb	16
34	amb	26	Ways *ways The ways.
35	amb	16	++++++++++++++++++++++++++++++++++++++*/
36
37	amb	31	NodesMem ChooseJunctions(Nodes nodes,Segments segments,Ways ways)
38	amb	16	{
39	amb	31	int i;
40			int count_oneway=0,count_twoway=0;
41			node_t node=0;
42			NodesMem *junctions;
43	amb	16
44	amb	31	/* Find junctions */
45
46			junctions=NewNodeList();
47
48			for(i=0;i<segments->number;i++)
49			{
50			Way *way;
51
52			if(i>0 && segments->segments[i].node1!=node)
53			{
54			if((count_oneway*2+count_twoway)>2)
55			{
56			Node *oldnode=FindNode(nodes,node);
57
58			AppendNode(junctions,node,oldnode->latitude,oldnode->longitude);
59			}
60
61			count_oneway=0;
62			count_twoway=0;
63			}
64
65			way=FindWay(ways,segments->segments[i].way);
66
67			if(way->type&Way_ONEWAY)
68			count_oneway++;
69			else
70			count_twoway++;
71
72			node=segments->segments[i].node1;
73
74			if(!(i%10000))
75			{
76			printf("\rFinding Junctions: Segments=%d Junctions=%d",i,junctions->number);
77			fflush(stdout);
78			}
79			}
80
81			printf("\rFound Junctions: Segments=%d Junctions=%d \n",segments->number,junctions->number);
82			fflush(stdout);
83
84			return(junctions);
85	amb	16	}
86	amb	31
87
88			/*++++++++++++++++++++++++++++++++++++++
89			Create the super-segments.
90
91			SegmentsMem *CreateSuperSegments Returns the set of super-segments.
92
93			Nodes *nodes The list of nodes.
94
95			Segments *segments The list of segments.
96
97			Ways *ways The list of ways.
98
99			Nodes *junctions The list of junctions.
100			++++++++++++++++++++++++++++++++++++++*/
101
102			SegmentsMem CreateSuperSegments(Nodes nodes,Segments segments,Ways ways,Nodes *junctions)
103			{
104			SegmentsMem *supersegments;
105			int i,j,k;
106
107			/* Create super-segments */
108
109			supersegments=NewSegmentList();
110
111			for(i=0;i<junctions->number;i++)
112			{
113			Results *results;
114
115			results=FindRoutes(nodes,segments,junctions->nodes[i].id,junctions);
116
117			for(j=0;j<NBINS_RESULTS;j++)
118			for(k=0;k<results->number[j];k++)
119			if(FindNode(junctions,results->results[j][k]->node))
120			{
121			distance_t distance;
122			duration_t duration;
123			Segment *segment=AppendSegment(supersegments,junctions->nodes[i].id,results->results[j][k]->node,0);
124
125			distance=results->results[j][k]->shortest.distance;
126			duration=results->results[j][k]->quickest.duration;
127
128			if(distance>(distance_short_t)~0)
129			{
130			fprintf(stderr,"\nSuper-Segment too long (%d->%d) = %.1f km\n",segment->node1,segment->node2,distance_to_km(distance));
131			distance=(distance_short_t)~0;
132			}
133
134			if(duration>(duration_short_t)~0)
135			{
136			fprintf(stderr,"\nSuper-Segment too long (%d->%d) = %.1f mins\n",segment->node1,segment->node2,duration_to_minutes(duration));
137			duration=(duration_short_t)~0;
138			}
139
140			segment->distance=distance;
141			segment->duration=duration;
142			}
143
144			FreeResultsList(results);
145
146			if(!(i%1000))
147			{
148			printf("\rFinding Super-Segments: Junctions=%d Super-Segments=%d",i,supersegments->number);
149			fflush(stdout);
150			}
151			}
152
153			printf("\rFound Super-Segments: Junctions=%d Super-Segments=%d \n",junctions->number,supersegments->number);
154			fflush(stdout);
155
156			return(supersegments);
157			}