Difference between revisions of "Vector network analysis/pl"
From GRASSWiki
(polish translation started) 
(No difference)

Revision as of 04:26, 10 September 2012
Contents
Vector network analysis
GRASS provides support for vector network analysis using the DGlib Directed Graph Library.
Implemented algorithms
The following algorithms are implemented (GRASS 6.5+):
 Utrzymanie sieci: v.net
 Najkrótsza droga: d.path and v.net.path
 Najkrótsza droga pomiędzy wieloma parami punktów v.net.allpairs
 Allocation of sources (create subnetworks, e.g. police station zones): v.net.alloc
 Isodistances (from centers): v.net.iso
 Computes bridges and articulation points: v.net.bridge
 Computes degree, centrality, betweeness, closeness and eigenvector centrality measures: v.net.centrality
 Computes strongly and weakly connected components: v.net.components
 Computes vertex connectivity between two sets of nodes: v.net.connectivity
 Computes shortest distance via the network between the given sets of features: v.net.distance
 Computes the maximum flow between two sets of nodes: v.net.flow
 Computes minimum spanning tree: v.net.spanningtree
 Minimum Steiner trees (starlike connections, e.g. broadband cable connections): v.net.steiner
 Znajdowanie najkrótszej drogi z użyciem rozkładów jazdy: v.net.timetable
 Traveling salesman (round trip): v.net.salesman
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
 see the v.net.path and d.path help pages
Nowe pomysły
 Vector network analysis ideas (please help to realize)
Zrzuty ekranu
 more screenshots from the GRASS website
See also
 GSoC Network Analysis: many new modules!