1v.net.steiner(1)              Grass User's Manual             v.net.steiner(1)
2
3
4

NAME

6       v.net.steiner   -  Create Steiner tree for the network and given termi‐
7       nals. Note that 'Minimum Steiner Tree' problem is NP-hard and heuristic
8       algorithm is used in this module so the the result may be sub optimal.
9

KEYWORDS

11       vector, networking
12

SYNOPSIS

14       v.net.steiner
15       v.net.steiner help
16       v.net.steiner  [-g]  input=name output=name  [type=string[,string,...]]
17       [alayer=integer]    [nlayer=integer]    [acolumn=string]    tcats=range
18       [nsp=integer]   [--overwrite]
19
20   Flags:
21       -g  Use geodesic calculation for longitude-latitude locations
22
23       --overwrite
24
25   Parameters:
26       input=name
27           Name of input vector map
28
29       output=name
30           Name for output vector map
31
32       type=string[,string,...]
33           Arc type Options: line,boundary Default: line,boundary
34
35       alayer=integer
36           Arc layer Default: 1
37
38       nlayer=integer
39           Node layer (used for terminals) Default: 2
40
41       acolumn=string
42           Arcs' cost column (for both directions)
43
44       tcats=range
45           Category  values Categories of points on terminals (layer is speci‐
46           fied by nlayer)
47
48       nsp=integer
49           Number of steiner poins. (-1 for all possible) Default: -1
50

DESCRIPTION

52       v.net.steiner calculates the optimal connection of nodes  on  a  vector
53       network.
54

EXAMPLE

56       TODO
57

SEE ALSO

59       d.path, v.net, v.net.alloc, v.net.iso, v.net.path, v.net.salesman
60

AUTHOR

62       Radim Blazek, ITC-Irst, Trento, Italy
63
64       Last changed: $Date: 2007/05/02 20:15:58 $
65
66       Full index
67
68
69
70GRASS 6.2.2                                                   v.net.steiner(1)
Impressum