1GNMANALYSE(1) GDAL GNMANALYSE(1)
2
3
4
6 gnmanalyse - Analyses networks
7
9 gnmanalyse [--help][-q][-quiet][--long-usage]
10 [dijkstra <start_gfid> <end_gfid> [[-alo NAME=VALUE] ...]]]
11 [kpaths <start_gfid> <end_gfid> <k> [[-alo NAME=VALUE] ...]]]
12 [resource [[-alo NAME=VALUE] ...]]]
13 [-ds <ds_name>][-f <ds_format>][-l <layer_name>]
14 [[-dsco NAME=VALUE] ...][-lco NAME=VALUE]
15 <gnm_name>
16
18 The gnmanalyse program provides analysing capabilities of geographical
19 networks in GDAL. The results of calculations are return in an OGRLayer
20 format or as a console text output if such layer is undefined. All cal‐
21 culations are made considering the blocking state of features.
22
23 dijkstra <start_gfid> <end_gfid>
24 Calculates the best path between two points using Dijkstra algo‐
25 rithm from start_gfid point to end_gfid point.
26
27 kpaths <start_gfid> <end_gfid>
28 Calculates K shortest paths between two points using Yen's algo‐
29 rithm (which internally uses Dijkstra algorithm for single path
30 calculating) from start_gfid point to end_gfid point.
31
32 resource
33 Calculates the "resource distribution". The connected components
34 search is performed using breadth-first search and starting from
35 that features which are marked by rules as 'EMITTERS'.
36
37 -d <ds_name>
38 The name and path of the dataset to save the layer with result‐
39 ing paths. Not need to be existed dataset.
40
41 -f <ds_format>
42 Define this to set the format of newly created dataset.
43
44 -l <layer_name>
45 The name of the resulting layer. If the layer exist already - it
46 will be rewritten.
47
48 <gnm_name>
49 The network to work with (path and name).
50
51 -dsco NAME=VALUE
52 Dataset creation option (format specific)
53
54 -lco NAME=VALUE
55 Layer creation option (format specific)
56
57 -alo NAME=VALUE
58 Algorithm option (format specific)
59
61 Mikhail Gusev <gusevmihs@gmail.com>, Dmitry Baryshnikov <poli‐
62 max@mail.ru>
63
65 1998-2023
66
67
68
69
70 Oct 30, 2023 GNMANALYSE(1)