topic_network.1grass - Man Page

Topic: network

d.pathFinds shortest path for selected starting and ending node. subnets for nearest centers. the shortest path between all pairs of nodes in the network. bridges and articulation points in the network. degree, centrality, betweeness, closeness and eigenvector centrality measures in the network. strongly and weakly connected components in the network. vertex connectivity between two sets of nodes in the network. shortest distance via the network between the given sets of features. the maximum flow between two sets of nodes in the network.
v.netPerforms network maintenance. subnets for nearest centers by cost isolines. shortest path on vector network. a cycle connecting given nodes (Traveling salesman problem). minimum spanning tree for the network. Steiner tree for the network and given terminals. shortest path using timetables. 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.2 Reference Manual


GRASS 8.3.2 GRASS GIS User's Manual