GRASS logo

Topic: network

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

See also the corresponding keyword network for additional references.

Main index | Topics index | Keywords index | Graphical index | Full index

© 2003-2024 GRASS Development Team, GRASS GIS 8.3.3dev Reference Manual