topic_network.1grass - Man Page

Topic: network

d.pathFinds shortest path for selected starting and ending node.
v.net.allocAllocates subnets for nearest centers.
v.net.allpairsComputes the shortest path between all pairs of nodes in the network.
v.net.bridgeComputes bridges and articulation points in the network.
v.net.centralityComputes degree, centrality, betweeness, closeness and eigenvector centrality measures in the network.
v.net.componentsComputes strongly and weakly connected components in the network.
v.net.connectivityComputes vertex connectivity between two sets of nodes in the network.
v.net.distanceComputes shortest distance via the network between the given sets of features.
v.net.flowComputes the maximum flow between two sets of nodes in the network.
v.netPerforms network maintenance.
v.net.isoSplits subnets for nearest centers by cost isolines.
v.net.pathFinds shortest path on vector network.
v.net.salesmanCreates a cycle connecting given nodes (Traveling salesman problem).
v.net.spanningtreeComputes minimum spanning tree for the network.
v.net.steinerCreates Steiner tree for the network and given terminals.
v.net.timetableFinds shortest path using timetables.
v.net.visibilityPerforms visibility graph construction.

See also the corresponding keyword network for additional references.

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

© 2003-2020 GRASS Development Team, GRASS GIS 7.8.5 Reference Manual

Info

GRASS 7.8.5 GRASS GIS User's Manual