Topic: network
| Tool | Description |
|---|---|
| d.path | Finds shortest path for selected starting and ending node. |
| v.net.alloc | Center node must be opened (costs >= 0). Costs of center node are used in calculation. |
| 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 | Finds the shortest paths from each 'from' point to the nearest 'to' feature and various information about this relation are uploaded to the attribute table. |
| v.net.flow | Computes the maximum flow between two sets of nodes in the network. |
| v.net.iso | Splits net to bands between cost isolines (direction from center). Center node must be opened (costs >= 0). Costs of center node are used in calculation. |
| v.net | Performs network maintenance. |
| v.net.path | Finds shortest path on vector network. |
| v.net.salesman | Note that TSP is NP-hard, heuristic algorithm is used by this module and created cycle may be sub optimal |
| v.net.spanningtree | Computes minimum spanning tree for the network. |
| v.net.steiner | Note that 'Minimum Steiner Tree' problem is NP-hard and heuristic algorithm is used in this module so the result may be sub optimal. |
| v.net.timetable | Finds shortest path using timetables. |
| v.net.visibility | Performs visibility graph construction. |
See also the corresponding keyword for additional references:
network
- Network analysis - wxGUI Vector Network Analysis Tool
- d.path - Finds shortest path for selected starting and ending node.
- r.connectivity.network - Compute connectivity measures for a set of habitat patches based on graph-theory
- v.isochrones - Creates isochrones from a road map and starting points
- v.lrs.create - Creates a linear reference system.
- v.lrs.label - Creates stationing from input lines, and linear reference system.
- v.lrs.segment - Creates points/segments from input lines, linear reference system and positions read from stdin or a file.
- v.lrs.where - Finds line id and real km+offset for given points in vector map using linear reference system.
- v.net - Performs network maintenance.
- v.net.alloc - Center node must be opened (costs >= 0). Costs of center node are used in calculation.
- 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.curvedarcs - Draws curved arcs between points (e.g. flows)
- v.net.distance - Finds the shortest paths from each 'from' point to the nearest 'to' feature and various information about this relation are uploaded to the attribute table.
- v.net.flow - Computes the maximum flow between two sets of nodes in the network.
- v.net.iso - Splits net to bands between cost isolines (direction from center). Center node must be opened (costs >= 0). Costs of center node are used in calculation.
- v.net.path - Finds shortest path on vector network.
- v.net.salesman - Note that TSP is NP-hard, heuristic algorithm is used by this module and created cycle may be sub optimal
- v.net.salesman.opt - Note that TSP is NP-hard, heuristic algorithm is used by this module and created cycle may be suboptimal
- v.net.spanningtree - Computes minimum spanning tree for the network.
- v.net.steiner - Note that 'Minimum Steiner Tree' problem is NP-hard and heuristic algorithm is used in this module so the result may be sub optimal.
- v.net.timetable - Finds shortest path using timetables.
- v.net.visibility - Performs visibility graph construction.