1topic_network(1)              Grass User's Manual             topic_network(1)
2
3
4

Topic: network

6       d.path                                                       Finds shortest path for selected starting and ending node.
7
8       v.net.alloc                                                  Allocates subnets for nearest centers.
9
10       v.net.allpairs                                               Computes the shortest path between all pairs of nodes in the
11                                                                    network.
12
13       v.net.bridge                                                 Computes bridges and articulation points in the network.
14
15       v.net.centrality                                             Computes  degree,  centrality,  betweeness,  closeness   and
16                                                                    eigenvector centrality measures in the network.
17
18       v.net.components                                             Computes  strongly  and  weakly  connected components in the
19                                                                    network.
20
21       v.net.connectivity                                           Computes vertex connectivity between two sets  of  nodes  in
22                                                                    the network.
23
24       v.net.distance                                               Computes shortest distance via the network between the given
25                                                                    sets of features.
26
27       v.net.flow                                                   Computes the maximum flow between two sets of nodes  in  the
28                                                                    network.
29
30       v.net                                                        Performs network maintenance.
31
32       v.net.iso                                                    Splits subnets for nearest centers by cost isolines.
33
34       v.net.path                                                   Finds shortest path on vector network.
35
36       v.net.salesman                                               Creates  a  cycle connecting given nodes (Traveling salesman
37                                                                    problem).
38
39       v.net.spanningtree                                           Computes minimum spanning tree for the network.
40
41       v.net.steiner                                                Creates Steiner tree for the network and given terminals.
42
43       v.net.timetable                                              Finds shortest path using timetables.
44
45       v.net.visibility                                             Performs visibility graph construction.
46
47
48       See also the corresponding keyword network for additional references.
49
50       Main index | Topics index | Keywords index |  Graphical  index  |  Full
51       index
52
53       © 2003-2019 GRASS Development Team, GRASS GIS 7.8.2 Reference Manual
54
55
56
57GRASS 7.8.2                                                   topic_network(1)