GRASS GIS 7.0.7svn Reference Manual: Topic network

Note: A new GRASS GIS stable version has been released: GRASS GIS 7.4, available here.
Updated manual page: here

Topic: network

Note: see also the corresponding keyword network for additional references.

d.path Finds shortest path for selected starting and ending node.

v.net.alloc Allocates subnets for nearest centers (direction from center).

v.net.allpairs Computes the shortest path between all pairs of nodes in the network.

v.net.bridge Computes bridges and articulation points in the network.

v.net.centrality Computes degree, centrality, betweeness, closeness and eigenvector centrality measures in the network.

v.net.components Computes strongly and weakly connected components in the network.

v.net.connectivity Computes vertex connectivity between two sets of nodes in the network.

v.net.distance Computes shortest distance via the network between the given sets of features.

v.net.flow Computes the maximum flow between two sets of nodes in the network.

v.net Performs network maintenance.

v.net.iso Splits net by cost isolines.

v.net.path Finds shortest path on vector network.

v.net.salesman Creates a cycle connecting given nodes (Traveling salesman problem).

v.net.spanningtree Computes minimum spanning tree for the network.

v.net.steiner Creates Steiner tree for the network and given terminals.

v.net.timetable Finds shortest path using timetables.

v.net.visibility Performs visibility graph construction.

Note: A new GRASS GIS stable version has been released: GRASS GIS 7.4, available here.
Updated manual page: here

Main index | Topics index | Keywords index | Full index

d.path	Finds shortest path for selected starting and ending node.
v.net.alloc	Allocates subnets for nearest centers (direction from center).
v.net.allpairs	Computes the shortest path between all pairs of nodes in the network.
v.net.bridge	Computes bridges and articulation points in the network.
v.net.centrality	Computes degree, centrality, betweeness, closeness and eigenvector centrality measures in the network.
v.net.components	Computes strongly and weakly connected components in the network.
v.net.connectivity	Computes vertex connectivity between two sets of nodes in the network.
v.net.distance	Computes shortest distance via the network between the given sets of features.
v.net.flow	Computes the maximum flow between two sets of nodes in the network.
v.net	Performs network maintenance.
v.net.iso	Splits net by cost isolines.
v.net.path	Finds shortest path on vector network.
v.net.salesman	Creates a cycle connecting given nodes (Traveling salesman problem).
v.net.spanningtree	Computes minimum spanning tree for the network.
v.net.steiner	Creates Steiner tree for the network and given terminals.
v.net.timetable	Finds shortest path using timetables.
v.net.visibility	Performs visibility graph construction.