Difference between revisions of "Vector network analysis/pl"

From GRASS-Wiki
Jump to: navigation, search
m (Nowe pomysły: translated to pl)
m (pl translation)
Line 3: Line 3:
 
GRASS provides support for vector network analysis using the [http://trac.osgeo.org/grass/browser/grass/trunk/lib/vector/dglib/ DGlib] Directed Graph Library.
 
GRASS provides support for vector network analysis using the [http://trac.osgeo.org/grass/browser/grass/trunk/lib/vector/dglib/ DGlib] Directed Graph Library.
  
== Implemented algorithms ==
+
== Zaimplementowane algorytmy ==
  
The following algorithms are implemented (GRASS 6.5+):
+
Poniższe algorytmy są zaimplementowane (w GRASS 6.5+):
  
 
* Utrzymanie sieci: {{cmd|v.net|version=70}}
 
* Utrzymanie sieci: {{cmd|v.net|version=70}}
 
* Najkrótsza droga: {{cmd|d.path|version=64}} and {{cmd|v.net.path|version=70}}
 
* Najkrótsza droga: {{cmd|d.path|version=64}} and {{cmd|v.net.path|version=70}}
 
* Najkrótsza droga pomiędzy wieloma parami punktów {{cmd|v.net.allpairs|version=70}}
 
* Najkrótsza droga pomiędzy wieloma parami punktów {{cmd|v.net.allpairs|version=70}}
* Allocation of sources (create subnetworks, e.g. police station zones): {{cmd|v.net.alloc|version=70}}
+
* Allocation of sources (tworzenie podsieci, np. police station zones): {{cmd|v.net.alloc|version=70}}
* Iso-distances (from centers): {{cmd|v.net.iso|version=70}}
+
* Jednakowe odległości (ze środków): {{cmd|v.net.iso|version=70}}
 
* Computes bridges and articulation points: {{cmd|v.net.bridge|version=70}}
 
* Computes bridges and articulation points: {{cmd|v.net.bridge|version=70}}
 
* Computes degree, centrality, betweeness, closeness and eigenvector centrality measures: {{cmd|v.net.centrality|version=70}}
 
* Computes degree, centrality, betweeness, closeness and eigenvector centrality measures: {{cmd|v.net.centrality|version=70}}
Line 29: Line 29:
 
== Example: Shortest path routing ==
 
== Example: Shortest path routing ==
  
* see the {{cmd|v.net.path}} and {{cmd|d.path}} help pages
+
* zobacz strony opisujące {{cmd|v.net.path}} i {{cmd|d.path}}
  
 
== Nowe pomysły ==
 
== Nowe pomysły ==

Revision as of 04:33, 10 September 2012

Vector network analysis

GRASS provides support for vector network analysis using the DGlib Directed Graph Library.

Zaimplementowane algorytmy

Poniższe algorytmy są zaimplementowane (w GRASS 6.5+):

Vector directions are defined by the digitizing direction (a-->--b). You can navigate either omnidirectionally or differently in each directions as both directions are supported. Network modules provide parameters to assign attribute columns to the forward and backward direction. To see how a vector is directed, use the "display" parameter of d.vect (set display=dir).

  • see the vectorintro "vector map processing and network analysis" help page

Example: Shortest path routing

Nowe pomysły

Zrzuty ekranu


v.net.iso - Split net to bands between cost isolines (direction from centre). Costs of centre node are used in calculation.


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


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

See also

Linki zewnętrzne