Difference between revisions of "Vector network analysis"

From GRASS-Wiki
Jump to: navigation, search
m (Screenshots)
(Screenshots: module desc)
Line 12: Line 12:
  
  
* [http://grass.ibiblio.org/grass63/manuals/html63_user/v.net.iso.html v.net.iso]
+
* [http://grass.ibiblio.org/grass63/manuals/html63_user/v.net.iso.html v.net.iso] - Split net to bands between cost isolines (direction from centre). Centre node must be opened (costs >= 0). Costs of centre node are used in calculation.
 
[[Image:V.net.iso.png]]
 
[[Image:V.net.iso.png]]
  
  
* [http://grass.ibiblio.org/grass63/manuals/html63_user/v.net.alloc.html v.net.alloc]
+
* [http://grass.ibiblio.org/grass63/manuals/html63_user/v.net.alloc.html v.net.alloc] - Allocates subnets for nearest centres (direction from centre). Costs of centre node are used in calculation.
 
[[Image:V.net.alloc.png]]
 
[[Image:V.net.alloc.png]]
  
  
* [http://grass.ibiblio.org/grass63/manuals/html63_user/d.path.html d.path]
+
* [http://grass.ibiblio.org/grass63/manuals/html63_user/d.path.html d.path] - Find shortest path for selected starting and ending node.
 
[[Image:D.path.jpg]]
 
[[Image:D.path.jpg]]

Revision as of 00:03, 21 February 2007

Shortest path routing and network analysis


Screenshots


  • v.net.iso - Split net to bands between cost isolines (direction from centre). Centre node must be opened (costs >= 0). Costs of centre node are used in calculation.

V.net.iso.png


  • v.net.alloc - Allocates subnets for nearest centres (direction from centre). Costs of centre node are used in calculation.

V.net.alloc.png


  • d.path - Find shortest path for selected starting and ending node.

D.path.jpg