File: main.c

package info (click to toggle)
grass 6.0.2-6
  • links: PTS
  • area: main
  • in suites: etch, etch-m68k
  • size: 40,044 kB
  • ctags: 31,303
  • sloc: ansic: 321,125; tcl: 25,676; sh: 11,176; cpp: 10,098; makefile: 5,025; fortran: 1,846; yacc: 493; lex: 462; perl: 133; sed: 1
file content (144 lines) | stat: -rw-r--r-- 4,746 bytes parent folder | download | duplicates (2)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
/****************************************************************
 *
 * MODULE:       v.net.path
 * 
 * AUTHOR(S):    Radim Blazek
 *               
 * PURPOSE:      Shortest path on vector network
 *               
 * COPYRIGHT:    (C) 2002 by the GRASS Development Team
 *
 *               This program is free software under the 
 *               GNU General Public License (>=v2). 
 *               Read the file COPYING that comes with GRASS
 *               for details.
 *
 ****************************************************************/
#include <stdlib.h>
#include "gis.h"
#include "Vect.h"

int path ( struct Map_info *, struct Map_info *, int, double, int );

int main(int argc, char **argv)
{
    struct Option *input_opt, *output_opt, *afield_opt, *nfield_opt, *afcol, *abcol, *ncol, *type_opt;
    struct Option *max_dist;
    struct Flag   *geo_f, *segments_f;
    struct GModule *module;
    char   *mapset;
    struct Map_info In, Out;
    int    type, afield, nfield, geo;
    double maxdist;

    /* Initialize the GIS calls */
    G_gisinit (argv[0]) ;

    module = G_define_module();
    module->description = "Find shortest path on vector network. Reads start/end points"
	    "from standard input in 2 possible formats:\n"
	    "id start_point_category end_point_category\n"
	    "id start_point_x start_point_y end_point_x end_point_y\n"
	    "Points specified by category must be exactly on network nodes.";

    input_opt = G_define_standard_option(G_OPT_V_INPUT);
    output_opt = G_define_standard_option(G_OPT_V_OUTPUT);

    type_opt =  G_define_standard_option(G_OPT_V_TYPE);
    type_opt->options    = "line,boundary";
    type_opt->answer     = "line,boundary";
    type_opt->description = "Arc type";

    afield_opt = G_define_standard_option(G_OPT_V_FIELD);
    afield_opt->key = "alayer";
    afield_opt->answer = "1";
    afield_opt->description = "Arc layer";
    
    nfield_opt = G_define_standard_option(G_OPT_V_FIELD);
    nfield_opt->key = "nlayer";
    nfield_opt->answer = "2";
    nfield_opt->description = "Node layer";

    afcol = G_define_option() ;
    afcol->key         = "afcolumn" ;
    afcol->type        = TYPE_STRING ;
    afcol->required    = NO ; 
    afcol->description = "Arc forward/both direction(s) cost column" ;
    
    abcol = G_define_option() ;
    abcol->key         = "abcolumn" ;
    abcol->type        = TYPE_STRING ;
    abcol->required    = NO ; 
    abcol->description = "Arc backward direction cost column" ;
    
    ncol = G_define_option() ;
    ncol->key         = "ncolumn" ;
    ncol->type        = TYPE_STRING ;
    ncol->required    = NO ; 
    ncol->description = "Node cost column" ;

    max_dist = G_define_option() ;
    max_dist->key = "dmax";
    max_dist->type = TYPE_DOUBLE;
    max_dist->required = NO;
    max_dist->answer = "1000";
    max_dist->description = "Maximum distance to the network if start/end are given as coordinates. "
			    "If start/end point is outside this threshold, the path is not found "
			    "and error message is printed. To speed up the process, keep this "
			    "value as low as possible.";
    
    geo_f = G_define_flag ();
    geo_f->key             = 'g';
    geo_f->description     = "Use geodesic calculation for longitude-latitude locations";
    
    segments_f = G_define_flag ();
    segments_f->key             = 's';
    segments_f->description     = "Write output as original input segments, not each path as one line.";
    
    if(G_parser(argc,argv))
        exit(-1);

    type = Vect_option_to_types ( type_opt ); 
    afield = atoi (afield_opt->answer);
    nfield = atoi (nfield_opt->answer);
    maxdist = atof ( max_dist->answer );

    if ( geo_f->answer ) {
       geo = 1; 
       if (G_projection () != PROJECTION_LL)
          G_warning("The current projection is not longitude-latitude");
    }
    else geo = 0;

    Vect_check_input_output_name ( input_opt->answer, output_opt->answer, GV_FATAL_EXIT );
    
    mapset = G_find_vector2 (input_opt->answer, NULL); 
      
    if ( mapset == NULL) 
      G_fatal_error ("Could not find input vector '%s'\n", input_opt->answer);

    Vect_set_open_level(2);
    Vect_open_old (&In, input_opt->answer, mapset); 

    Vect_set_fatal_error (GV_FATAL_PRINT);
    if (1 > Vect_open_new (&Out, output_opt->answer, Vect_is_3d(&In) )){
        Vect_close (&In);
	G_fatal_error ("Failed opening output vector file");
    }
    Vect_hist_command ( &Out );

    Vect_net_build_graph ( &In, type, afield, nfield, afcol->answer, abcol->answer, 
	                   ncol->answer, geo, 0 );

    path ( &In, &Out, nfield, maxdist, segments_f->answer ); 

    Vect_close(&In);

    Vect_build (&Out, stdout);
    Vect_close(&Out);

    exit(0);
}