[GRASS-SVN] r41787 - in grass/branches/develbranch_6/vector:
v.net.allpairs v.net.bridge v.net.centrality v.net.components
v.net.connectivity v.net.distance v.net.flow
v.net.spanningtree v.net.timetable
svn_grass at osgeo.org
svn_grass at osgeo.org
Sat Apr 10 15:16:26 EDT 2010
Author: martinl
Date: 2010-04-10 15:16:21 -0400 (Sat, 10 Apr 2010)
New Revision: 41787
Added:
grass/branches/develbranch_6/vector/v.net.allpairs/description.html
grass/branches/develbranch_6/vector/v.net.bridge/description.html
grass/branches/develbranch_6/vector/v.net.centrality/description.html
grass/branches/develbranch_6/vector/v.net.components/description.html
grass/branches/develbranch_6/vector/v.net.connectivity/description.html
grass/branches/develbranch_6/vector/v.net.distance/description.html
grass/branches/develbranch_6/vector/v.net.flow/description.html
grass/branches/develbranch_6/vector/v.net.spanningtree/description.html
grass/branches/develbranch_6/vector/v.net.timetable/description.html
Removed:
grass/branches/develbranch_6/vector/v.net.allpairs/v.net.allpairs.html
grass/branches/develbranch_6/vector/v.net.bridge/v.net.bridge.html
grass/branches/develbranch_6/vector/v.net.centrality/v.net.centrality.html
grass/branches/develbranch_6/vector/v.net.components/v.net.components.html
grass/branches/develbranch_6/vector/v.net.connectivity/v.net.connectivity.html
grass/branches/develbranch_6/vector/v.net.distance/v.net.distance.html
grass/branches/develbranch_6/vector/v.net.flow/v.net.flow.html
grass/branches/develbranch_6/vector/v.net.spanningtree/v.net.spanningtree.html
grass/branches/develbranch_6/vector/v.net.timetable/v.net.timetable.html
Log:
manual page renamed to description.html
Copied: grass/branches/develbranch_6/vector/v.net.allpairs/description.html (from rev 41786, grass/branches/develbranch_6/vector/v.net.allpairs/v.net.allpairs.html)
===================================================================
--- grass/branches/develbranch_6/vector/v.net.allpairs/description.html (rev 0)
+++ grass/branches/develbranch_6/vector/v.net.allpairs/description.html 2010-04-10 19:16:21 UTC (rev 41787)
@@ -0,0 +1,34 @@
+<h2>DESCRIPTION</h2>
+
+<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.
+
+<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.
+<div class="code"><pre>
+v.net.allpairs input=roads output=roads_pairs afcol=SHAPE_LEN where="crossing=1"
+</pre></div>
+<P>
+
+
+<h2>SEE ALSO</h2>
+
+<em>
+<a HREF="v.net.path">v.net.path</a>,
+<a HREF="v.net.distance">v.net.distance</a>
+</em>
+
+
+<h2>AUTHORS</h2>
+
+Daniel Bundala, Google Summer of Code 2009, Student<br>
+Wolf Bergenheim, Mentor
+
+<p>
+<i>Last changed: $Date$</i>
Deleted: grass/branches/develbranch_6/vector/v.net.allpairs/v.net.allpairs.html
===================================================================
--- grass/branches/develbranch_6/vector/v.net.allpairs/v.net.allpairs.html 2010-04-10 19:12:24 UTC (rev 41786)
+++ grass/branches/develbranch_6/vector/v.net.allpairs/v.net.allpairs.html 2010-04-10 19:16:21 UTC (rev 41787)
@@ -1,34 +0,0 @@
-<h2>DESCRIPTION</h2>
-
-<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.
-
-<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.
-<div class="code"><pre>
-v.net.allpairs input=roads output=roads_pairs afcol=SHAPE_LEN where="crossing=1"
-</pre></div>
-<P>
-
-
-<h2>SEE ALSO</h2>
-
-<em>
-<a HREF="v.net.path">v.net.path</a>,
-<a HREF="v.net.distance">v.net.distance</a>
-</em>
-
-
-<h2>AUTHORS</h2>
-
-Daniel Bundala, Google Summer of Code 2009, Student<br>
-Wolf Bergenheim, Mentor
-
-<p>
-<i>Last changed: $Date$</i>
Copied: grass/branches/develbranch_6/vector/v.net.bridge/description.html (from rev 41786, grass/branches/develbranch_6/vector/v.net.bridge/v.net.bridge.html)
===================================================================
--- grass/branches/develbranch_6/vector/v.net.bridge/description.html (rev 0)
+++ grass/branches/develbranch_6/vector/v.net.bridge/description.html 2010-04-10 19:16:21 UTC (rev 41787)
@@ -0,0 +1,34 @@
+<h2>DESCRIPTION</h2>
+
+<em>v.net.bridge</em> finds bridges and articulation points in a network.
+
+<h2>NOTES</h2>
+Bridge in a network is an edge/line whose removal would disconnect the (sub-)network. A node is an articulation point if its removal would disconnect the (sub-)network. For more information and formal definitions check the wikipedia entries: <a href="http://en.wikipedia.org/wiki/Bridge_%28graph_theory%29">bridge</a> and <a href="http://en.wikipedia.org/wiki/Cut_vertex">articulation point</a>.<br><br>
+The output of the module contains the selected features. If <b>method=bridge</b> then lines corresponding to bridges are copied from the input map to the output map. On the other hand, if <b>method=articulation</b> then point are created on the positions of articulation points.<br><br>
+
+
+<br>In GRASS, <em>line</em> is not always a single line segments. It might be, and often is, a sequence of line segments between two intersections. Also, articulation point is a standard graph theoretic terminology which is slightly misleading in GRASS. An articulation point in graph theory is an articulation <em>node</em> in GRASS terminology.
+
+<h2>EXAMPLES</h2>
+
+<div class="code"><pre>
+</pre></div>
+<P>
+
+<div class="code"><pre>
+</pre></div>
+
+
+<h2>SEE ALSO</h2>
+
+<em>
+<a HREF="v.category.html">v.category</a>,
+</em>
+
+<h2>AUTHORS</h2>
+
+Daniel Bundala, Google Summer of Code 2009, Student<br>
+Wolf Bergenheim, Mentor
+
+<p>
+<i>Last changed: $Date$</i>
Deleted: grass/branches/develbranch_6/vector/v.net.bridge/v.net.bridge.html
===================================================================
--- grass/branches/develbranch_6/vector/v.net.bridge/v.net.bridge.html 2010-04-10 19:12:24 UTC (rev 41786)
+++ grass/branches/develbranch_6/vector/v.net.bridge/v.net.bridge.html 2010-04-10 19:16:21 UTC (rev 41787)
@@ -1,34 +0,0 @@
-<h2>DESCRIPTION</h2>
-
-<em>v.net.bridge</em> finds bridges and articulation points in a network.
-
-<h2>NOTES</h2>
-Bridge in a network is an edge/line whose removal would disconnect the (sub-)network. A node is an articulation point if its removal would disconnect the (sub-)network. For more information and formal definitions check the wikipedia entries: <a href="http://en.wikipedia.org/wiki/Bridge_%28graph_theory%29">bridge</a> and <a href="http://en.wikipedia.org/wiki/Cut_vertex">articulation point</a>.<br><br>
-The output of the module contains the selected features. If <b>method=bridge</b> then lines corresponding to bridges are copied from the input map to the output map. On the other hand, if <b>method=articulation</b> then point are created on the positions of articulation points.<br><br>
-
-
-<br>In GRASS, <em>line</em> is not always a single line segments. It might be, and often is, a sequence of line segments between two intersections. Also, articulation point is a standard graph theoretic terminology which is slightly misleading in GRASS. An articulation point in graph theory is an articulation <em>node</em> in GRASS terminology.
-
-<h2>EXAMPLES</h2>
-
-<div class="code"><pre>
-</pre></div>
-<P>
-
-<div class="code"><pre>
-</pre></div>
-
-
-<h2>SEE ALSO</h2>
-
-<em>
-<a HREF="v.category.html">v.category</a>,
-</em>
-
-<h2>AUTHORS</h2>
-
-Daniel Bundala, Google Summer of Code 2009, Student<br>
-Wolf Bergenheim, Mentor
-
-<p>
-<i>Last changed: $Date$</i>
Copied: grass/branches/develbranch_6/vector/v.net.centrality/description.html (from rev 41786, grass/branches/develbranch_6/vector/v.net.centrality/v.net.centrality.html)
===================================================================
--- grass/branches/develbranch_6/vector/v.net.centrality/description.html (rev 0)
+++ grass/branches/develbranch_6/vector/v.net.centrality/description.html 2010-04-10 19:16:21 UTC (rev 41787)
@@ -0,0 +1,33 @@
+<h2>DESCRIPTION</h2>
+
+<em>v.net.centrality</em> computes degree, closeness, betweenness and eigenvector centrality measures.
+
+<h2>NOTES</h2>
+
+The module computes various centrality measures for each node and stores them in the given columns of an attribute table, which is created and linked to the output map. For the description of these, please check the following <a href="http://en.wikipedia.org/wiki/Centrality">wikipedia article</a>. If the column name is not given for a measure then that measure is not computed. If <b>-a</b> flag is set then points are added on nodes without points. Also, the points for which the output is computed can be specified by <b>cats</b>, <b>layer</b> and <b>where</b> parameters. However, if any of these parameters is present then <b>-a</b> flag is ingored and no new points are added.<br>
+Betwenness measure is not normalised. In order to get the normalised values (between 0 and 1), each number needs to be divided by <em>N choose 2=N*(N-1)/2</em> where N is the number of nodes in the connected component. Computation of eigenvector measure terminates if the given number of iterations is reached or the cummulative <em>squared</em> error between the successive iterations is less than <b>error</b>.
+
+<h2>EXAMPLES</h2>
+Compute closeness and betweenness centrality measures for each node and produce a map containing not only points already present in the input map but a map with point on every node.
+<div class="code"><pre>
+v.net.centrality input=roads output=roads_cent closeness=close betweenness=betw -a
+</pre></div>
+<P>
+
+<div class="code"><pre>
+</pre></div>
+
+
+<h2>SEE ALSO</h2>
+
+<em>
+<a HREF="v.generalize.html">v.generalize</a>
+</em>
+
+<h2>AUTHORS</h2>
+
+Daniel Bundala, Google Summer of Code 2009, Student<br>
+Wolf Bergenheim, Mentor
+
+<p>
+<i>Last changed: $Date$</i>
Deleted: grass/branches/develbranch_6/vector/v.net.centrality/v.net.centrality.html
===================================================================
--- grass/branches/develbranch_6/vector/v.net.centrality/v.net.centrality.html 2010-04-10 19:12:24 UTC (rev 41786)
+++ grass/branches/develbranch_6/vector/v.net.centrality/v.net.centrality.html 2010-04-10 19:16:21 UTC (rev 41787)
@@ -1,33 +0,0 @@
-<h2>DESCRIPTION</h2>
-
-<em>v.net.centrality</em> computes degree, closeness, betweenness and eigenvector centrality measures.
-
-<h2>NOTES</h2>
-
-The module computes various centrality measures for each node and stores them in the given columns of an attribute table, which is created and linked to the output map. For the description of these, please check the following <a href="http://en.wikipedia.org/wiki/Centrality">wikipedia article</a>. If the column name is not given for a measure then that measure is not computed. If <b>-a</b> flag is set then points are added on nodes without points. Also, the points for which the output is computed can be specified by <b>cats</b>, <b>layer</b> and <b>where</b> parameters. However, if any of these parameters is present then <b>-a</b> flag is ingored and no new points are added.<br>
-Betwenness measure is not normalised. In order to get the normalised values (between 0 and 1), each number needs to be divided by <em>N choose 2=N*(N-1)/2</em> where N is the number of nodes in the connected component. Computation of eigenvector measure terminates if the given number of iterations is reached or the cummulative <em>squared</em> error between the successive iterations is less than <b>error</b>.
-
-<h2>EXAMPLES</h2>
-Compute closeness and betweenness centrality measures for each node and produce a map containing not only points already present in the input map but a map with point on every node.
-<div class="code"><pre>
-v.net.centrality input=roads output=roads_cent closeness=close betweenness=betw -a
-</pre></div>
-<P>
-
-<div class="code"><pre>
-</pre></div>
-
-
-<h2>SEE ALSO</h2>
-
-<em>
-<a HREF="v.generalize.html">v.generalize</a>
-</em>
-
-<h2>AUTHORS</h2>
-
-Daniel Bundala, Google Summer of Code 2009, Student<br>
-Wolf Bergenheim, Mentor
-
-<p>
-<i>Last changed: $Date$</i>
Copied: grass/branches/develbranch_6/vector/v.net.components/description.html (from rev 41786, grass/branches/develbranch_6/vector/v.net.components/v.net.components.html)
===================================================================
--- grass/branches/develbranch_6/vector/v.net.components/description.html (rev 0)
+++ grass/branches/develbranch_6/vector/v.net.components/description.html 2010-04-10 19:16:21 UTC (rev 41787)
@@ -0,0 +1,35 @@
+<h2>DESCRIPTION</h2>
+
+<em>v.net.components</em> computes the weakly and strongly connected components in a network.
+
+<h2>NOTES</h2>
+Two nodes, <em>u</em> and <em>v</em> are in the same strongly connected component if there are directed paths from <em>u</em> to <em>v</em> and from <em>v</em> to <em>u</em>. The nodes are in the same weakly connected component if, ignoring orientation of the edges, there is a path between them.<br>
+
+The type of components is specified by <b>method</b> parameter. Module creates a table and links it to the given <b>layer</b>. This table contains only two integer columns: <em>cat</em> and <em>comp</em>. If a point or both endpoints of a line belong to the same component then the point/line is written to the output map and appropriate information is stored in the table. If <b>-a</b> flag is set then new points are added on the nodes without points. These points have category numbers larger than any category used in the input map.
+
+<h2>EXAMPLES</h2>
+
+Any road network should form a single strongly connected components. Otherwise,
+it is impossible to travel between some places.
+<div class="code"><pre>
+v.net.components input=roads output=roads_components method=strong
+</pre></div>
+<P>
+
+<div class="code"><pre>
+</pre></div>
+
+
+<h2>SEE ALSO</h2>
+
+<em>
+<a HREF="v.category.html">v.category</a>,
+</em>
+
+<h2>AUTHORS</h2>
+
+Daniel Bundala, Google Summer of Code 2009, Student<br>
+Wolf Bergenheim, Mentor
+
+<p>
+<i>Last changed: $Date$</i>
Deleted: grass/branches/develbranch_6/vector/v.net.components/v.net.components.html
===================================================================
--- grass/branches/develbranch_6/vector/v.net.components/v.net.components.html 2010-04-10 19:12:24 UTC (rev 41786)
+++ grass/branches/develbranch_6/vector/v.net.components/v.net.components.html 2010-04-10 19:16:21 UTC (rev 41787)
@@ -1,35 +0,0 @@
-<h2>DESCRIPTION</h2>
-
-<em>v.net.components</em> computes the weakly and strongly connected components in a network.
-
-<h2>NOTES</h2>
-Two nodes, <em>u</em> and <em>v</em> are in the same strongly connected component if there are directed paths from <em>u</em> to <em>v</em> and from <em>v</em> to <em>u</em>. The nodes are in the same weakly connected component if, ignoring orientation of the edges, there is a path between them.<br>
-
-The type of components is specified by <b>method</b> parameter. Module creates a table and links it to the given <b>layer</b>. This table contains only two integer columns: <em>cat</em> and <em>comp</em>. If a point or both endpoints of a line belong to the same component then the point/line is written to the output map and appropriate information is stored in the table. If <b>-a</b> flag is set then new points are added on the nodes without points. These points have category numbers larger than any category used in the input map.
-
-<h2>EXAMPLES</h2>
-
-Any road network should form a single strongly connected components. Otherwise,
-it is impossible to travel between some places.
-<div class="code"><pre>
-v.net.components input=roads output=roads_components method=strong
-</pre></div>
-<P>
-
-<div class="code"><pre>
-</pre></div>
-
-
-<h2>SEE ALSO</h2>
-
-<em>
-<a HREF="v.category.html">v.category</a>,
-</em>
-
-<h2>AUTHORS</h2>
-
-Daniel Bundala, Google Summer of Code 2009, Student<br>
-Wolf Bergenheim, Mentor
-
-<p>
-<i>Last changed: $Date$</i>
Copied: grass/branches/develbranch_6/vector/v.net.connectivity/description.html (from rev 41786, grass/branches/develbranch_6/vector/v.net.connectivity/v.net.connectivity.html)
===================================================================
--- grass/branches/develbranch_6/vector/v.net.connectivity/description.html (rev 0)
+++ grass/branches/develbranch_6/vector/v.net.connectivity/description.html 2010-04-10 19:16:21 UTC (rev 41787)
@@ -0,0 +1,33 @@
+<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.
+
+<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.
+
+<h2>EXAMPLES</h2>
+The following command finds the minimum number of intersection 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>
+<P>
+
+<div class="code"><pre>
+v.net.connectivity input=airtraffic output=connectivity set1_where="name=JFK" set2_where="name=Heathrow" ncolumn=capacity
+</pre></div>
+
+
+<h2>SEE ALSO</h2>
+
+<em>
+<a HREF="v.net.flow.html">v.net.flow</a>,
+<a HREF="v.net.bridge.html">v.net.bridge</a>
+</em>
+
+<h2>AUTHORS</h2>
+
+Daniel Bundala, Google Summer of Code 2009, Student<br>
+Wolf Bergenheim, Mentor
+
+<p>
+<i>Last changed: $Date$</i>
Deleted: grass/branches/develbranch_6/vector/v.net.connectivity/v.net.connectivity.html
===================================================================
--- grass/branches/develbranch_6/vector/v.net.connectivity/v.net.connectivity.html 2010-04-10 19:12:24 UTC (rev 41786)
+++ grass/branches/develbranch_6/vector/v.net.connectivity/v.net.connectivity.html 2010-04-10 19:16:21 UTC (rev 41787)
@@ -1,33 +0,0 @@
-<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.
-
-<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.
-
-<h2>EXAMPLES</h2>
-The following command finds the minimum number of intersection 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>
-<P>
-
-<div class="code"><pre>
-v.net.connectivity input=airtraffic output=connectivity set1_where="name=JFK" set2_where="name=Heathrow" ncolumn=capacity
-</pre></div>
-
-
-<h2>SEE ALSO</h2>
-
-<em>
-<a HREF="v.net.flow.html">v.net.flow</a>,
-<a HREF="v.net.bridge.html">v.net.bridge</a>
-</em>
-
-<h2>AUTHORS</h2>
-
-Daniel Bundala, Google Summer of Code 2009, Student<br>
-Wolf Bergenheim, Mentor
-
-<p>
-<i>Last changed: $Date$</i>
Copied: grass/branches/develbranch_6/vector/v.net.distance/description.html (from rev 41786, grass/branches/develbranch_6/vector/v.net.distance/v.net.distance.html)
===================================================================
--- grass/branches/develbranch_6/vector/v.net.distance/description.html (rev 0)
+++ grass/branches/develbranch_6/vector/v.net.distance/description.html 2010-04-10 19:16:21 UTC (rev 41787)
@@ -0,0 +1,33 @@
+<h2>DESCRIPTION</h2>
+
+<em>v.net.distance</em> finds the nearast element from set <em>to</em> for every element in set <em>from</em>.
+
+<h2>NOTES</h2>
+
+These two sets are given by the respective <b>layer</b>, <b>where</b> and <b>cats</b> parameters. The type of <em>to</em> features is specified by <b>to_type</b> parameter and all <em>from</em> features are <em>points</em>. A table is linked to <b>output</b> map containing various information about the relation. More specifically, the table has three columns: <em>cat</em>, <em>tcat</em> and <em>dist</em> storing category of each <em>from</em> feature, category of the nearest <em>to</em> feature and the distance between them respectively. Furthemore, <b>output</b> map contains the shorest path between each <em>cat</em>, <em>tcat</em> pair. Each path consist of several lines. If a line is on the shorest path from a point then the category of this point is assigned to the line. Note that every line may contain more than one category value since single line may be on the shortest path for more than one <em>from</em> feature. And so the shortest paths can be easily obtained by querying lines with corresponding category number.<br>
+The costs of arcs in forward and backward direction are specified by <b>afcolumn</b> and <b>abcolumn</b> columns respectively. If <b>abcolumn</b> is not given, the same cost is used in both directions.
+
+<h2>EXAMPLES</h2>
+Find shortest path and distance from every school to the nearest hospital and show path from school number one.
+<div class="code"><pre>
+v.net.distance input=city output=nearest from_where="type=school" to_where="type=hospital" afcolumn=SHAPE_LEN
+d.vect nearest cats=1
+</pre></div>
+<P>
+
+<h2>SEE ALSO</h2>
+
+<em>
+<a HREF="v.net.path.html">v.net.path</a>,
+<a HREF="v.net.allpairs.html">v.net.allpairs</a>,
+<a HREF="v.distance.html">v.net.distance</a>,
+<a HREF="v.net.alloc.html">v.net.alloc</a>
+</em>
+
+<h2>AUTHORS</h2>
+
+Daniel Bundala, Google Summer of Code 2009, Student<br>
+Wolf Bergenheim, Mentor
+
+<p>
+<i>Last changed: $Date$</i>
Deleted: grass/branches/develbranch_6/vector/v.net.distance/v.net.distance.html
===================================================================
--- grass/branches/develbranch_6/vector/v.net.distance/v.net.distance.html 2010-04-10 19:12:24 UTC (rev 41786)
+++ grass/branches/develbranch_6/vector/v.net.distance/v.net.distance.html 2010-04-10 19:16:21 UTC (rev 41787)
@@ -1,33 +0,0 @@
-<h2>DESCRIPTION</h2>
-
-<em>v.net.distance</em> finds the nearast element from set <em>to</em> for every element in set <em>from</em>.
-
-<h2>NOTES</h2>
-
-These two sets are given by the respective <b>layer</b>, <b>where</b> and <b>cats</b> parameters. The type of <em>to</em> features is specified by <b>to_type</b> parameter and all <em>from</em> features are <em>points</em>. A table is linked to <b>output</b> map containing various information about the relation. More specifically, the table has three columns: <em>cat</em>, <em>tcat</em> and <em>dist</em> storing category of each <em>from</em> feature, category of the nearest <em>to</em> feature and the distance between them respectively. Furthemore, <b>output</b> map contains the shorest path between each <em>cat</em>, <em>tcat</em> pair. Each path consist of several lines. If a line is on the shorest path from a point then the category of this point is assigned to the line. Note that every line may contain more than one category value since single line may be on the shortest path for more than one <em>from</em> feature. And so the shortest paths can be easily obtained by querying lines with corresponding category number.<br>
-The costs of arcs in forward and backward direction are specified by <b>afcolumn</b> and <b>abcolumn</b> columns respectively. If <b>abcolumn</b> is not given, the same cost is used in both directions.
-
-<h2>EXAMPLES</h2>
-Find shortest path and distance from every school to the nearest hospital and show path from school number one.
-<div class="code"><pre>
-v.net.distance input=city output=nearest from_where="type=school" to_where="type=hospital" afcolumn=SHAPE_LEN
-d.vect nearest cats=1
-</pre></div>
-<P>
-
-<h2>SEE ALSO</h2>
-
-<em>
-<a HREF="v.net.path.html">v.net.path</a>,
-<a HREF="v.net.allpairs.html">v.net.allpairs</a>,
-<a HREF="v.distance.html">v.net.distance</a>,
-<a HREF="v.net.alloc.html">v.net.alloc</a>
-</em>
-
-<h2>AUTHORS</h2>
-
-Daniel Bundala, Google Summer of Code 2009, Student<br>
-Wolf Bergenheim, Mentor
-
-<p>
-<i>Last changed: $Date$</i>
Copied: grass/branches/develbranch_6/vector/v.net.flow/description.html (from rev 41786, grass/branches/develbranch_6/vector/v.net.flow/v.net.flow.html)
===================================================================
--- grass/branches/develbranch_6/vector/v.net.flow/description.html (rev 0)
+++ grass/branches/develbranch_6/vector/v.net.flow/description.html 2010-04-10 19:16:21 UTC (rev 41787)
@@ -0,0 +1,37 @@
+<h2>DESCRIPTION</h2>
+
+<em>v.net.flow</em> computes the maximum flow and minimum cut between two sets of nodes.
+
+<h2>NOTES</h2>
+The two sets of nodes are called <em>sources</em> and <em>sink</em> and <em>v.net.flow</em> finds the maximimum flow from the former to the latter ones. Edge capacities can be specified by <b>afcolumn</b> for forward direction and <b>abcolumn</b> for backward direction. If the latter parameter is ommited then the same capacity is used in either direction. The sets are given by the respective <b>cats</b>, <b>layer</b> and <b>where</b> parameters. Maximum flow corresponds to the maximum amount of water possibly flowing through the network preserving the capacity constraints and minimum cut to set of edges of minimum total capacity completely separating sources from sinks. The cut produced by this module corresponds to the first fully saturated edges from sources to sinks. An attribute table containing the flow information is linked to the <b>output</b> map. The table consists of two columns: <em>cat</em> and <em>flow</em> and stores the flow along each line. Negative flow means that "water" is flowing in the backward direction. <b>Cut</b> map contains the edges in the minimum cut. <br>
+A famous <a href="http://en.wikipedia.org/wiki/Max-flow_min-cut_theorem">result</a> says that the total amount of water flowing is equal to the minimum cut.
+
+
+<h2>EXAMPLES</h2>
+
+Find maximum flow from factories to stores using SPEED for the capacities.
+<div class="code"><pre>
+v.net.flow input=roads output=roads_flow cut=roads_cut afcolumn=SPEED source_where="type=factory" sink_where="type=store"
+</pre></div>
+<P>
+
+If all the capacties are one then the minimum cut corresponds to the minimum number of edges separating sources from sinks.
+<div class="code"><pre>
+v.net.flow input=network output=flow cut=cut afcolumn=ones source_cats=1-10 sink_cats=100-100
+</pre></div>
+
+
+<h2>SEE ALSO</h2>
+
+<em>
+<a HREF="v.net.connectivity.html">v.net.connectivity</a>
+</em>
+
+
+<h2>AUTHORS</h2>
+
+Daniel Bundala, Google Summer of Code 2009, Student<br>
+Wolf Bergenheim, Mentor
+
+<p>
+<i>Last changed: $Date$</i>
Deleted: grass/branches/develbranch_6/vector/v.net.flow/v.net.flow.html
===================================================================
--- grass/branches/develbranch_6/vector/v.net.flow/v.net.flow.html 2010-04-10 19:12:24 UTC (rev 41786)
+++ grass/branches/develbranch_6/vector/v.net.flow/v.net.flow.html 2010-04-10 19:16:21 UTC (rev 41787)
@@ -1,37 +0,0 @@
-<h2>DESCRIPTION</h2>
-
-<em>v.net.flow</em> computes the maximum flow and minimum cut between two sets of nodes.
-
-<h2>NOTES</h2>
-The two sets of nodes are called <em>sources</em> and <em>sink</em> and <em>v.net.flow</em> finds the maximimum flow from the former to the latter ones. Edge capacities can be specified by <b>afcolumn</b> for forward direction and <b>abcolumn</b> for backward direction. If the latter parameter is ommited then the same capacity is used in either direction. The sets are given by the respective <b>cats</b>, <b>layer</b> and <b>where</b> parameters. Maximum flow corresponds to the maximum amount of water possibly flowing through the network preserving the capacity constraints and minimum cut to set of edges of minimum total capacity completely separating sources from sinks. The cut produced by this module corresponds to the first fully saturated edges from sources to sinks. An attribute table containing the flow information is linked to the <b>output</b> map. The table consists of two columns: <em>cat</em> and <em>flow</em> and stores the flow along each line. Negative flow means that "water" is flowing in the backward direction. <b>Cut</b> map contains the edges in the minimum cut. <br>
-A famous <a href="http://en.wikipedia.org/wiki/Max-flow_min-cut_theorem">result</a> says that the total amount of water flowing is equal to the minimum cut.
-
-
-<h2>EXAMPLES</h2>
-
-Find maximum flow from factories to stores using SPEED for the capacities.
-<div class="code"><pre>
-v.net.flow input=roads output=roads_flow cut=roads_cut afcolumn=SPEED source_where="type=factory" sink_where="type=store"
-</pre></div>
-<P>
-
-If all the capacties are one then the minimum cut corresponds to the minimum number of edges separating sources from sinks.
-<div class="code"><pre>
-v.net.flow input=network output=flow cut=cut afcolumn=ones source_cats=1-10 sink_cats=100-100
-</pre></div>
-
-
-<h2>SEE ALSO</h2>
-
-<em>
-<a HREF="v.net.connectivity.html">v.net.connectivity</a>
-</em>
-
-
-<h2>AUTHORS</h2>
-
-Daniel Bundala, Google Summer of Code 2009, Student<br>
-Wolf Bergenheim, Mentor
-
-<p>
-<i>Last changed: $Date$</i>
Copied: grass/branches/develbranch_6/vector/v.net.spanningtree/description.html (from rev 41786, grass/branches/develbranch_6/vector/v.net.spanningtree/v.net.spanningtree.html)
===================================================================
--- grass/branches/develbranch_6/vector/v.net.spanningtree/description.html (rev 0)
+++ grass/branches/develbranch_6/vector/v.net.spanningtree/description.html 2010-04-10 19:16:21 UTC (rev 41787)
@@ -0,0 +1,28 @@
+<h2>DESCRIPTION</h2>
+
+<em>v.net.spanningtree</em> find the minimum spanning tree in a network.
+
+<h2>NOTES</h2>
+Spanning tree is a minimum cost subnetwork connecting all nodes in a network. Or, if a network is disconnected then the module computes the minimum spanning tree for each (weakly) connected component. So, strictly speaking, module does not compute spanning tree but a spanning forest. As the name suggests spanning tree is a tree. That is, it contains no cycles and if a component has N nodes that the tree has N-1 edges and connected all nodes. <b>Accol</b> is used to specify the costs of the edges. The <b>output</b> consists of the edges in the spanning tree.
+
+<h2>EXAMPLES</h2>
+
+Find cheapest set of pipelines connecting all nodes.
+<div class="code"><pre>
+v.net.spanningtree input=projected_pipelines output=spanningtree accol=cost
+</pre></div>
+<P>
+
+<h2>SEE ALSO</h2>
+
+<em>
+<a HREF="v.net.steiner.html">v.net.steiner</a>
+</em>
+
+<h2>AUTHORS</h2>
+
+Daniel Bundala, Google Summer of Code 2009, Student<br>
+Wolf Bergenheim, Mentor
+
+<p>
+<i>Last changed: $Date$</i>
Deleted: grass/branches/develbranch_6/vector/v.net.spanningtree/v.net.spanningtree.html
===================================================================
--- grass/branches/develbranch_6/vector/v.net.spanningtree/v.net.spanningtree.html 2010-04-10 19:12:24 UTC (rev 41786)
+++ grass/branches/develbranch_6/vector/v.net.spanningtree/v.net.spanningtree.html 2010-04-10 19:16:21 UTC (rev 41787)
@@ -1,28 +0,0 @@
-<h2>DESCRIPTION</h2>
-
-<em>v.net.spanningtree</em> find the minimum spanning tree in a network.
-
-<h2>NOTES</h2>
-Spanning tree is a minimum cost subnetwork connecting all nodes in a network. Or, if a network is disconnected then the module computes the minimum spanning tree for each (weakly) connected component. So, strictly speaking, module does not compute spanning tree but a spanning forest. As the name suggests spanning tree is a tree. That is, it contains no cycles and if a component has N nodes that the tree has N-1 edges and connected all nodes. <b>Accol</b> is used to specify the costs of the edges. The <b>output</b> consists of the edges in the spanning tree.
-
-<h2>EXAMPLES</h2>
-
-Find cheapest set of pipelines connecting all nodes.
-<div class="code"><pre>
-v.net.spanningtree input=projected_pipelines output=spanningtree accol=cost
-</pre></div>
-<P>
-
-<h2>SEE ALSO</h2>
-
-<em>
-<a HREF="v.net.steiner.html">v.net.steiner</a>
-</em>
-
-<h2>AUTHORS</h2>
-
-Daniel Bundala, Google Summer of Code 2009, Student<br>
-Wolf Bergenheim, Mentor
-
-<p>
-<i>Last changed: $Date$</i>
Copied: grass/branches/develbranch_6/vector/v.net.timetable/description.html (from rev 41786, grass/branches/develbranch_6/vector/v.net.timetable/v.net.timetable.html)
===================================================================
--- grass/branches/develbranch_6/vector/v.net.timetable/description.html (rev 0)
+++ grass/branches/develbranch_6/vector/v.net.timetable/description.html 2010-04-10 19:16:21 UTC (rev 41787)
@@ -0,0 +1,86 @@
+<h2>DESCRIPTION</h2>
+
+<em>v.net.timetable</em> finds the shortest path between two points using timetables. Module reads input, one query per line, from the standard input and writes output to the standard output as well as to the <b>output</b> map and to tables linked to layers 1 and 2. Each line of input must follow one of the following formats:
+<pre>
+PATH_ID FROM_X FROM_Y TO_X TO_Y START_TIME MIN_CHANGE MAX_CHANGES WALK_CHANGE
+PATH_ID FROM_STOP TO_STOP START_TIME MIN_CHANGE MAX_CHANGES WALK_CHANGE
+</pre>
+where PATH_ID is the identificator of a query that is used in the output map to differentiate between queries. Search begins at START_TIME. MIN_CHANGE gives the minimum number of time (inclusively) for a change from one route to another. MAX_CHANGES denotes the maximum number of changes allowed or -1 if infinity. WALK_CHANGE is 1 or 0 depending whether walking from a stop to another stop is considered a change or not. Finally, the path is found from FROM_STOP to TO_STOP in latter case and from the stop closest to (FROM_X, FROM_Y) coordinates to the stop closest to (TO_X, TO_Y) coordinates in former case.<br>
+For each input query, module outputs a description of the shortest path to the standard output. For example, using the tables given below, for the following input:
+<div class="code"><pre>
+47 130 300 0 1 5 0
+</pre></div>
+the following output is produced:
+<div class="code"><pre>
+Route 15, from 130 leaving at 15 arriving to 250 at 22
+Walk from 250 leaving at 22 arriving to 300 at 24
+</pre></div>
+Moreover, the module writes the path to the <b>output</b> map and stores all the information necesasary to reconstruct the path to the tables. Table corresponding to stops/points is linked to layer 1 and looks, after the query, as follows:
+<div class="code"><pre>
+cat|path_id|stop_id|index|arr_time|dep_time
+1|47|130|1|0|15
+2|47|250|2|22|22
+3|47|300|3|24|24
+</pre></div>
+where CAT is the category of a point in the map, PATH_ID is the path identificator, STOP_ID is the identificator of the stop as used in the intput map, INDEX is the index of the stop on the path (i.e, index=1 is the first stop visited, ...) and ARR_TIME and DEP_TIME denote the arrival time and departure time respectively. Arrival time for the first stop on the path is always equal to START_TIME and departure time for the last stop is always equal to the arrival time.<br>
+Table linked to the second layer corresponds to subroutes taken between stops. The following table is obtainedd for the above query:
+<div class="code"><pre>
+cat|path_id|from_id|to_id|route_id|index|from_time|to_time
+1|47|130|250|15|1|15|22
+2|47|250|300|-1|2|22|24
+</pre></div>
+where CAT is the category of lines of subroute between stops FROM_ID to TO_ID, ROUTE_ID is the identificator of the route taken or -1 if walking, INDEX and PATH_ID are as above and FROM_TIME and TO_TIME denote the times between which the route is taken.<br>
+The <b>output</b> map contains the points on the positions of used stops. If a subroute is taken between two stops then a line segment is added between two corresponding points. Finally, instead of straight line segment, the actual paths of routes can be given in <b>paths</b> layer. If this parameter is used then each line in the input map must contain identificators as category numbers of all routes passing through the line. The module then finds the path between two stops and writes this path instead. In case of walking from one stop to another, straight line between the stops is used.
+
+<h2>NOTES</h2>
+
+Timetables are stored in a table linked to the given <b>layer</b> of the <b>input</b> map. Timetable consists of routes and each route is just a sequence of stops with specified arrival times. If two sequences of stops differ only in times then they still correspond to two routes. For example, if there is a bus line that leaves every 20 minutes and follow exactly the same path every time then there still needs to be a separate route for every time. For each stop (given by the category number of the point) the table storing information about the routes must contain the list of all routes stopping at the stop(given by route identificators) together with arrival times. That is, the table must contain three columns: stop - which is the key of the table, <b>route_id</b> and <b>stop_time</b> where each triple corresponds to a route arriving to a stop and a certain time. For example, a valid table might look as follows:
+<div class="code"><pre>
+cat|route_id|stop_time
+100|5|0
+130|5|10
+150|5|20
+250|5|30
+300|5|40
+260|15|5
+130|15|15
+250|15|22
+150|35|17
+250|35|27
+300|35|37
+100|35|50
+</pre></div>
+Note that <b>stop_time</b> is an integer and so you can use any units and offest to specify arrival times.<br>
+Also, walking connections between stops can be given by a table linked to <b>walking</b> layer of the <b>input</b> map. If this parameter is -1 then walking between stops is not allowed. The table must contain three columns: stop - which is the key of the table, <b>to_stop</b> and <b>length</b>. A record in the table says that it takes <b>lenght</b> units of time to walk from stop to <b>to_stop</b>. The following is a valid table:
+<div class="code"><pre>
+cat|length|to_stop
+250|2|300
+</pre></div>
+Beware that this only means that it is possible to walk from stop 250 to stop 300 but the other way round.
+
+<h2>EXAMPLES</h2>
+
+To find a path from stop with identificator 130 to stop with category 300, starting at time 0, with one time unit for change, maximum of 5 changes and with walking not considered a change of route, we use the following command:
+<div class="code"><pre>
+echo "47 130 300 0 1 5 0" | v.net.timetable input=buses output=path layer=5 walking=6 path=7
+</pre></div>
+
+If on the other, hand we know the coordinates of the places then the following command might be used
+<div class="code"><pre>
+echo "47 10.31 54.31 90.21 28.21 0 1 5 0" | v.net.timetable input=buses output=path layer=5 walking=6 path=7
+</pre></div>
+
+<h2>SEE ALSO</h2>
+
+<em>
+<a HREF="v.net.path.html">v.net.path</a>,
+<a HREF="v.net.distance.html">v.net.distance</a>
+</em>
+
+<h2>AUTHORS</h2>
+
+Daniel Bundala, Google Summer of Code 2009, Student<br>
+Wolf Bergenheim, Mentor
+
+<p>
+<i>Last changed: $Date$</i>
Deleted: grass/branches/develbranch_6/vector/v.net.timetable/v.net.timetable.html
===================================================================
--- grass/branches/develbranch_6/vector/v.net.timetable/v.net.timetable.html 2010-04-10 19:12:24 UTC (rev 41786)
+++ grass/branches/develbranch_6/vector/v.net.timetable/v.net.timetable.html 2010-04-10 19:16:21 UTC (rev 41787)
@@ -1,86 +0,0 @@
-<h2>DESCRIPTION</h2>
-
-<em>v.net.timetable</em> finds the shortest path between two points using timetables. Module reads input, one query per line, from the standard input and writes output to the standard output as well as to the <b>output</b> map and to tables linked to layers 1 and 2. Each line of input must follow one of the following formats:
-<pre>
-PATH_ID FROM_X FROM_Y TO_X TO_Y START_TIME MIN_CHANGE MAX_CHANGES WALK_CHANGE
-PATH_ID FROM_STOP TO_STOP START_TIME MIN_CHANGE MAX_CHANGES WALK_CHANGE
-</pre>
-where PATH_ID is the identificator of a query that is used in the output map to differentiate between queries. Search begins at START_TIME. MIN_CHANGE gives the minimum number of time (inclusively) for a change from one route to another. MAX_CHANGES denotes the maximum number of changes allowed or -1 if infinity. WALK_CHANGE is 1 or 0 depending whether walking from a stop to another stop is considered a change or not. Finally, the path is found from FROM_STOP to TO_STOP in latter case and from the stop closest to (FROM_X, FROM_Y) coordinates to the stop closest to (TO_X, TO_Y) coordinates in former case.<br>
-For each input query, module outputs a description of the shortest path to the standard output. For example, using the tables given below, for the following input:
-<div class="code"><pre>
-47 130 300 0 1 5 0
-</pre></div>
-the following output is produced:
-<div class="code"><pre>
-Route 15, from 130 leaving at 15 arriving to 250 at 22
-Walk from 250 leaving at 22 arriving to 300 at 24
-</pre></div>
-Moreover, the module writes the path to the <b>output</b> map and stores all the information necesasary to reconstruct the path to the tables. Table corresponding to stops/points is linked to layer 1 and looks, after the query, as follows:
-<div class="code"><pre>
-cat|path_id|stop_id|index|arr_time|dep_time
-1|47|130|1|0|15
-2|47|250|2|22|22
-3|47|300|3|24|24
-</pre></div>
-where CAT is the category of a point in the map, PATH_ID is the path identificator, STOP_ID is the identificator of the stop as used in the intput map, INDEX is the index of the stop on the path (i.e, index=1 is the first stop visited, ...) and ARR_TIME and DEP_TIME denote the arrival time and departure time respectively. Arrival time for the first stop on the path is always equal to START_TIME and departure time for the last stop is always equal to the arrival time.<br>
-Table linked to the second layer corresponds to subroutes taken between stops. The following table is obtainedd for the above query:
-<div class="code"><pre>
-cat|path_id|from_id|to_id|route_id|index|from_time|to_time
-1|47|130|250|15|1|15|22
-2|47|250|300|-1|2|22|24
-</pre></div>
-where CAT is the category of lines of subroute between stops FROM_ID to TO_ID, ROUTE_ID is the identificator of the route taken or -1 if walking, INDEX and PATH_ID are as above and FROM_TIME and TO_TIME denote the times between which the route is taken.<br>
-The <b>output</b> map contains the points on the positions of used stops. If a subroute is taken between two stops then a line segment is added between two corresponding points. Finally, instead of straight line segment, the actual paths of routes can be given in <b>paths</b> layer. If this parameter is used then each line in the input map must contain identificators as category numbers of all routes passing through the line. The module then finds the path between two stops and writes this path instead. In case of walking from one stop to another, straight line between the stops is used.
-
-<h2>NOTES</h2>
-
-Timetables are stored in a table linked to the given <b>layer</b> of the <b>input</b> map. Timetable consists of routes and each route is just a sequence of stops with specified arrival times. If two sequences of stops differ only in times then they still correspond to two routes. For example, if there is a bus line that leaves every 20 minutes and follow exactly the same path every time then there still needs to be a separate route for every time. For each stop (given by the category number of the point) the table storing information about the routes must contain the list of all routes stopping at the stop(given by route identificators) together with arrival times. That is, the table must contain three columns: stop - which is the key of the table, <b>route_id</b> and <b>stop_time</b> where each triple corresponds to a route arriving to a stop and a certain time. For example, a valid table might look as follows:
-<div class="code"><pre>
-cat|route_id|stop_time
-100|5|0
-130|5|10
-150|5|20
-250|5|30
-300|5|40
-260|15|5
-130|15|15
-250|15|22
-150|35|17
-250|35|27
-300|35|37
-100|35|50
-</pre></div>
-Note that <b>stop_time</b> is an integer and so you can use any units and offest to specify arrival times.<br>
-Also, walking connections between stops can be given by a table linked to <b>walking</b> layer of the <b>input</b> map. If this parameter is -1 then walking between stops is not allowed. The table must contain three columns: stop - which is the key of the table, <b>to_stop</b> and <b>length</b>. A record in the table says that it takes <b>lenght</b> units of time to walk from stop to <b>to_stop</b>. The following is a valid table:
-<div class="code"><pre>
-cat|length|to_stop
-250|2|300
-</pre></div>
-Beware that this only means that it is possible to walk from stop 250 to stop 300 but the other way round.
-
-<h2>EXAMPLES</h2>
-
-To find a path from stop with identificator 130 to stop with category 300, starting at time 0, with one time unit for change, maximum of 5 changes and with walking not considered a change of route, we use the following command:
-<div class="code"><pre>
-echo "47 130 300 0 1 5 0" | v.net.timetable input=buses output=path layer=5 walking=6 path=7
-</pre></div>
-
-If on the other, hand we know the coordinates of the places then the following command might be used
-<div class="code"><pre>
-echo "47 10.31 54.31 90.21 28.21 0 1 5 0" | v.net.timetable input=buses output=path layer=5 walking=6 path=7
-</pre></div>
-
-<h2>SEE ALSO</h2>
-
-<em>
-<a HREF="v.net.path.html">v.net.path</a>,
-<a HREF="v.net.distance.html">v.net.distance</a>
-</em>
-
-<h2>AUTHORS</h2>
-
-Daniel Bundala, Google Summer of Code 2009, Student<br>
-Wolf Bergenheim, Mentor
-
-<p>
-<i>Last changed: $Date$</i>
More information about the grass-commit
mailing list