[GRASS-SVN] r46552 - grass/trunk/vector/v.net.allpairs

[svn_grass at osgeo.org]

Author: mmetz
Date: 2011-06-03 09:17:05 -0700 (Fri, 03 Jun 2011)
New Revision: 46552

Modified:
   grass/trunk/vector/v.net.allpairs/v.net.allpairs.html
Log:
update manual

Modified: grass/trunk/vector/v.net.allpairs/v.net.allpairs.html
===================================================================
--- grass/trunk/vector/v.net.allpairs/v.net.allpairs.html	2011-06-03 16:16:53 UTC (rev 46551)
+++ grass/trunk/vector/v.net.allpairs/v.net.allpairs.html	2011-06-03 16:17:05 UTC (rev 46552)
@@ -1,16 +1,32 @@
 <h2>DESCRIPTION</h2>
 
-<em>v.net.allpairs</em> computes the shortest path between each select node and all other nodes. 
+<em>v.net.allpairs</em> computes the shortest path between each select 
+node and all other nodes. 
 
 <h2>NOTES</h2>
 
-An attribute table is created and linked to <b>layer</b>. The table contains three columns: <em>cat</em>, <em>to_cat</em>, <em>cost</em>. Each entry denotes the cost of the shortest path from <em>cat</em> to <em>to_cat</em>. If the cost is negative then no path exists. If points are specified by <b>cats, layer</b> or <b>where</b> parameters then the table is filled only for the selected points. In other words, <em>cat</em> columns contains only selected points but the distances are computed and updated for <em>all</em> other nodes.<br>
-If flag <b>-a</b> is set then new points are added on nodes without nodes. These points have the largest categorie. Precisely, category of each new point is larger than any of the old categories. If the flag is not set then no new points are created and hence the attribute table stores the costs only between the points already present in the input. Output consists of all points mentioned in either of the columns.<br>
-If <b>abcolumn</b> is not given then then the same costs are used for forward and backward arcs.
+An attribute table is created and linked to <b>layer</b>. The table 
+contains three columns: <em>cat</em>, <em>to_cat</em>, <em>cost</em>. 
+Each entry denotes the cost of the shortest path from <em>cat</em> to 
+<em>to_cat</em>. If the cost is negative then no path exists. If points 
+are specified by <b>cats, layer</b> or <b>where</b> parameters then the 
+table is filled only for the selected points. In other words, <em>cat</em> 
+columns contains only selected points but the distances are computed and 
+updated for <em>all</em> other nodes.<br>
+If flag <b>-a</b> is set then new points are added on nodes without points. 
+These points have the largest category. Precisely, the category of each new 
+point is larger than any of the old categories. If the flag is not set 
+then no new points are created and hence the attribute table stores the 
+costs only between the points already present in the input. Output consists 
+of all points mentioned in either of the columns.<br>
+If <b>abcolumn</b> is not given then then the same costs are used for 
+forward and backward arcs.
 
 <h2>EXAMPLES</h2>
 
-Find shortest path from each intersection with pedestrian crossing to every other point using <em>SHAPE_LEN</em> for the cost of traversing the arcs in both directions.
+Find shortest path from each intersection with pedestrian crossing to 
+every other point using <em>SHAPE_LEN</em> for the cost of traversing 
+the arcs in both directions.
 <div class="code"><pre>
 v.net.allpairs input=roads output=roads_pairs afcol=SHAPE_LEN where="crossing=1"
 </pre></div>