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
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
|
/****************************************************************
*
* MODULE: v.net.path
*
* AUTHOR(S): Radim Blazek
* Stepan Turek <stepan.turek seznam.cz> (turns support)
*
* PURPOSE: Shortest path on vector network
*
* COPYRIGHT: (C) 2002, 2014 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 <grass/gis.h>
#include <grass/vector.h>
#include <grass/glocale.h>
int path(struct Map_info *, struct Map_info *, char *, int, double, int, int,
int);
int main(int argc, char **argv)
{
struct Option *input_opt, *output_opt, *afield_opt, *nfield_opt,
*tfield_opt, *tucfield_opt, *afcol, *abcol, *ncol, *type_opt;
struct Option *max_dist, *file_opt;
struct Flag *geo_f, *segments_f, *turntable_f;
struct GModule *module;
struct Map_info In, Out;
int type, afield, nfield, tfield, tucfield, geo;
double maxdist;
/* Initialize the GIS calls */
G_gisinit(argv[0]);
module = G_define_module();
G_add_keyword(_("vector"));
G_add_keyword(_("network"));
G_add_keyword(_("shortest path"));
module->description = _("Finds shortest path on vector network.");
input_opt = G_define_standard_option(G_OPT_V_INPUT);
output_opt = G_define_standard_option(G_OPT_V_OUTPUT);
afield_opt = G_define_standard_option(G_OPT_V_FIELD);
afield_opt->key = "arc_layer";
afield_opt->answer = "1";
afield_opt->required = YES;
afield_opt->label = _("Arc layer");
type_opt = G_define_standard_option(G_OPT_V_TYPE);
type_opt->key = "arc_type";
type_opt->options = "line,boundary";
type_opt->answer = "line,boundary";
type_opt->required = YES;
type_opt->label = _("Arc type");
nfield_opt = G_define_standard_option(G_OPT_V_FIELD);
nfield_opt->key = "node_layer";
nfield_opt->answer = "2";
nfield_opt->required = YES;
nfield_opt->label = _("Node layer");
file_opt = G_define_standard_option(G_OPT_F_INPUT);
file_opt->key = "file";
file_opt->required = NO;
file_opt->description = _("Name of file containing start and end points. "
"If not given, read from stdin");
afcol = G_define_option();
afcol->key = "arc_column";
afcol->type = TYPE_STRING;
afcol->required = NO;
afcol->description =
_("Arc forward/both direction(s) cost column (number)");
afcol->guisection = _("Cost");
abcol = G_define_option();
abcol->key = "arc_backward_column";
abcol->type = TYPE_STRING;
abcol->required = NO;
abcol->description = _("Arc backward direction cost column (number)");
abcol->guisection = _("Cost");
ncol = G_define_option();
ncol->key = "node_column";
ncol->type = TYPE_STRING;
ncol->required = NO;
ncol->description = _("Node cost column (number)");
ncol->guisection = _("Cost");
max_dist = G_define_option();
max_dist->key = "dmax";
max_dist->type = TYPE_DOUBLE;
max_dist->required = NO;
max_dist->answer = "1000";
max_dist->label = _("Maximum distance to the network");
max_dist->description =
_("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.");
turntable_f = G_define_flag();
turntable_f->key = 't';
turntable_f->description = _("Use turntable");
turntable_f->guisection = _("Turntable");
tfield_opt = G_define_standard_option(G_OPT_V_FIELD);
tfield_opt->key = "turn_layer";
tfield_opt->answer = "3";
tfield_opt->label = _("Layer with turntable");
tfield_opt->description = _("Relevant only with -t flag");
tfield_opt->guisection = _("Turntable");
tucfield_opt = G_define_standard_option(G_OPT_V_FIELD);
tucfield_opt->key = "turn_cat_layer";
tucfield_opt->answer = "4";
tucfield_opt->label = _("Layer with unique categories used in turntable");
tucfield_opt->description = _("Relevant only with -t flag");
tucfield_opt->guisection = _("Turntable");
geo_f = G_define_flag();
geo_f->key = 'g';
geo_f->description =
_("Use geodesic calculation for longitude-latitude projects");
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(EXIT_FAILURE);
type = Vect_option_to_types(type_opt);
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,
G_FATAL_EXIT);
Vect_set_open_level(2);
if (Vect_open_old(&In, input_opt->answer, "") < 0)
G_fatal_error(_("Unable to open vector map <%s>"), input_opt->answer);
afield = Vect_get_field_number(&In, afield_opt->answer);
nfield = Vect_get_field_number(&In, nfield_opt->answer);
tfield = Vect_get_field_number(&In, tfield_opt->answer);
tucfield = Vect_get_field_number(&In, tucfield_opt->answer);
if (1 > Vect_open_new(&Out, output_opt->answer, Vect_is_3d(&In))) {
Vect_close(&In);
G_fatal_error(_("Unable to create vector map <%s>"),
output_opt->answer);
}
Vect_hist_command(&Out);
if (turntable_f->answer)
Vect_net_ttb_build_graph(&In, type, afield, nfield, tfield, tucfield,
afcol->answer, abcol->answer, ncol->answer,
geo, 0);
else
Vect_net_build_graph(&In, type, afield, nfield, afcol->answer,
abcol->answer, ncol->answer, geo, 0);
path(&In, &Out, file_opt->answer, nfield, maxdist, segments_f->answer,
tucfield, turntable_f->answer);
Vect_close(&In);
Vect_build(&Out);
Vect_close(&Out);
exit(EXIT_SUCCESS);
}
|
