update manuals

git-svn-id: https://svn.osgeo.org/grass/grass/trunk@46554 15284696-431f-4ddb-bdfa-cd5b030d7da7

vector/v.net.connectivity/v.net.connectivity.html

@@ -1,12 +1,21 @@
 <h2>DESCRIPTION</h2>
 
-<em>v.net.connectivity</em> computes vertex connectivity between two sets. i.e., minimum number of vertices whose removal would separate two given sets. 
+<em>v.net.connectivity</em> computes vertex connectivity between two sets,
+ i.e. the minimum number of vertices whose removal would separate two 
+ given sets. 
 
 <h2>NOTES</h2>
-Two sets (<em>set1</em> and <em>set2</em>) are specified by respective <b>layer</b>, <b>where</b> and <b>cats</b> parameters. Similarly to <a HREF="v.net.flow.html">v.net.flow</a> module, capacities of nodes can be given by <b>ncolumn</b> option. Module finds the set of nodes of minimum total capacitiy separating the two given sets and outputs map containing points on the positions of these nodes. Default capacity, which is used when no column is specified, is one.
+Two sets (<em>set1</em> and <em>set2</em>) are specified by respective 
+<b>layer</b>, <b>where</b> and <b>cats</b> parameters. Similarly to 
+<a HREF="v.net.flow.html">v.net.flow</a> module, capacities of nodes can 
+be given by <b>ncolumn</b> option. <em>v.net.connectivity</em> finds the 
+set of nodes of minimum total capacitiy separating the two given sets and 
+outputs map containing points on the positions of these nodes. Default 
+capacity, which is used when no column is specified, is one.
 
 <h2>EXAMPLES</h2>
-The following command finds the minimum number of intersection separating roads on the left bank from roads on the right bank. 
+The following command finds the minimum number of intersections separating 
+roads on the left bank from roads on the right bank. 
 <div class="code"><pre>
 v.net.connectivity input=roads output=roads_conn set1_where="bank=left" set2_where="bank=right"
 </pre></div>

vector/v.net.iso/v.net.iso.html

@@ -1,10 +1,14 @@
 <h2>DESCRIPTION</h2>
 
-<em>v.net.iso</em> splits net to bands between cost isolines (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.
+<em>v.net.iso</em> splits a network into bands between cost isolines 
+(distance from centre). Centre nodes must be opened (costs >= 0). The 
+costs of centre nodes are used in the calculation. Supported are cost 
+assignments for both arcs and nodes, and also different in both 
+directions of a vector line. For areas, costs will be calculated along 
+boundary lines.
+<p>
+The input vector needs to be prepared with <em>v.net operation=connect</em> 
+in order to connect points representing centre nodes to the network.
 
 <h2>NOTES</h2>
 
@@ -17,9 +21,8 @@ using cost = -1.
 
 Subdivision of a network into areas:<br>
 
-The map must contain at least one center
-(point) on the vector network which can be patched into with
-<a HREF="v.patch.html">v.patch</a>.
+The map must contain at least one center (point) on the vector network 
+which can be patched into with <a HREF="v.net.html">v.net</a>.
 
 <div class="code"><pre>
 # Spearfish

vector/v.net.path/v.net.path.html

@@ -2,11 +2,11 @@
 
 <em>v.net.path</em> can find shortest path(s) on the vector network.
 Costs may be either line lengths, or attributes saved in a database 
-table. These attributes values are taken as costs of whole segments. If read 
+table. These attributes values are taken as costs of whole segments, not 
+as costs to traverse a lnegth unit (e.g. meter) of the segment. If read 
 from the table, arcs' costs may be different in both directions.
-Shortest paths are written to output vector map and attached attribute table.
+Shortest paths are written to output vector map with an attached attribute table.
 <P>
-
 Nodes can be piped into the program from file or from stdin. The
 syntax is as follows:
 <div class="code"><pre>
@@ -20,12 +20,14 @@ id start_point_x start_point_y end_point_x end_point_y
 </pre></div>
 
 <p>
-Points specified by category must be exactly on network nodes,
-while, when specifying coordinates, the next node to a given
-coordinate pair is used.
-</p>
+Points specified by category must be exactly on network nodes, and the 
+input vector map needs to be prepared with <em>v.net operation=connect</em>.
+<p>
+When specifying coordinates, the next network node to a given coordinate 
+pair is used.
+
 <p>
-Attribute table will contain following attributes:
+The attribute table will contain the following attributes:
 </p>
 <ul>
     <li>cat  - path unique category assigned by module</li>
@@ -43,7 +45,7 @@ Attribute table will contain following attributes:
     <li>tdist - the distance from the network to second point</li>
 </ul>
 
-<h2>NOTE</h2>
+<h2>NOTES</h2>
 
 If the columns 'afcol', 'abcol' and 'ncol' costs are not
 specified, the length of network segments is measured and 

vector/v.net.salesman/v.net.salesman.html

@@ -6,6 +6,9 @@ is used to estimate travelling costs. If a cost column is given, the cost
 values must indicate the costs to traverse a given line, e.g. if the speed
 limit is 100 km / h, the cost to traverse a 10 km long road segment is 
 calculated as length / speed = 10 km / (100 km/h) = 0.1 h.
+<p>
+Points specified by category must be exactly on network nodes, and the 
+input vector map needs to be prepared with <em>v.net operation=connect</em>.
 
 <h2>EXAMPLE</h2>
 

vector/v.net.steiner/v.net.steiner.html

@@ -10,6 +10,10 @@ For example it could be used to find the path following a road system
 which will minimize the amount of fibre optic cable needed to connect
 a series of satellite offices.
 
+<p>
+Points representing nodes must be exactly on network nodes, and the 
+input vector map needs to be prepared with <em>v.net operation=connect</em>.
+
 
 <h2>EXAMPLE</h2>