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
|
<h2>DESCRIPTION</h2>
<em>v.net.alloc</em> allocates subnets for nearest centres (direction from
centre). Centre node must be opened (costs >= 0). Costs of centre node are
used in calculation. Supported are cost assignments for both arcs and nodes,
and also different in both directions of a vector line. For areas cost will
be calculated along boundary lines.
<h2>NOTES</h2>
Center nodes have to be assigned to vector nodes using <em>v.digit</em>.
Nodes and arcs can be closed using cost = -1.
<h2>EXAMPLE</h2>
<pre>
# nlayer=1 if no extra table for nodes:
v.net.alloc network out=network_alloc ccats=0-13 nlayer=1
# the result has to be selected by category number of the relevant node:
d.vect network_alloc cat=9 col=red
d.vect network_alloc cat=11 col=green
d.vect network_alloc cat=2492 col=yellow
</pre>
<p>
<em>Calculating subnets for 7 centre nodes using cost assigned to vector length
</em><br>
<b>v.net.alloc in=</b>vectmap <b>out=</b>vectmap.alloc <b>ccats=</b>1-7
<p>
<em>Calculating subnets for 7 centre nodes using cost assignments in both
directions</em><br>
<b>v.net.alloc in=</b>vectmap <b>afcol=</b>INDEX <b>abcol=</b>INDEXBACK
<b>out=</b>vectmap.alloc <b>ccats=</b>1-7
<h2>SEE ALSO</h2>
<em><a HREF="d.path.html">d.path</a></em>
<em><a HREF="v.net.iso.html">v.net.iso</a></em>
<em><a HREF="v.net.steiner.html">v.net.steiner</a></em>
<em><a HREF="v.net.salesman.html">v.net.salesman</a></em>
<h2>AUTHOR</h2>
Radim Blazek, ITC-Irst, Trento, Italy
<p><i>Last changed: $Date: 2005/01/30 14:06:13 $</i>
|
