topic_network.html 3.42 KB
Newer Older
xuebingbing's avatar
xuebingbing committed
1 2 3
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<html>
<head>
xuebingbing's avatar
xuebingbing committed
4
 <title>GRASS GIS 7.8.5 Reference Manual: Topic network</title>
xuebingbing's avatar
xuebingbing committed
5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45
 <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
 <meta name="Author" content="GRASS Development Team">

<link rel="stylesheet" href="grassdocs.css" type="text/css">
</head>
<body bgcolor="white">
<div id="container">

<a href="index.html"><img src="grass_logo.png" alt="GRASS logo"></a>
<hr class="header">

<h2>Topic: network</h2>

<table>
<tr><td valign="top"><a href="d.path.html">d.path</a></td> <td>Finds shortest path for selected starting and ending node.</td></tr>
<tr><td valign="top"><a href="v.net.alloc.html">v.net.alloc</a></td> <td>Allocates subnets for nearest centers.<BR></td></tr>
<tr><td valign="top"><a href="v.net.allpairs.html">v.net.allpairs</a></td> <td>Computes the shortest path between all pairs of nodes in the network.</td></tr>
<tr><td valign="top"><a href="v.net.bridge.html">v.net.bridge</a></td> <td>Computes bridges and articulation points in the network.</td></tr>
<tr><td valign="top"><a href="v.net.centrality.html">v.net.centrality</a></td> <td>Computes degree, centrality, betweeness, closeness and eigenvector centrality measures in the network.</td></tr>
<tr><td valign="top"><a href="v.net.components.html">v.net.components</a></td> <td>Computes strongly and weakly connected components in the network.</td></tr>
<tr><td valign="top"><a href="v.net.connectivity.html">v.net.connectivity</a></td> <td>Computes vertex connectivity between two sets of nodes in the network.</td></tr>
<tr><td valign="top"><a href="v.net.distance.html">v.net.distance</a></td> <td>Computes shortest distance via the network between the given sets of features.<BR></td></tr>
<tr><td valign="top"><a href="v.net.flow.html">v.net.flow</a></td> <td>Computes the maximum flow between two sets of nodes in the network.</td></tr>
<tr><td valign="top"><a href="v.net.html">v.net</a></td> <td>Performs network maintenance.</td></tr>
<tr><td valign="top"><a href="v.net.iso.html">v.net.iso</a></td> <td>Splits subnets for nearest centers by cost isolines.<BR></td></tr>
<tr><td valign="top"><a href="v.net.path.html">v.net.path</a></td> <td>Finds shortest path on vector network.</td></tr>
<tr><td valign="top"><a href="v.net.salesman.html">v.net.salesman</a></td> <td>Creates a cycle connecting given nodes (Traveling salesman problem).<BR></td></tr>
<tr><td valign="top"><a href="v.net.spanningtree.html">v.net.spanningtree</a></td> <td>Computes minimum spanning tree for the network.</td></tr>
<tr><td valign="top"><a href="v.net.steiner.html">v.net.steiner</a></td> <td>Creates Steiner tree for the network and given terminals.<BR></td></tr>
<tr><td valign="top"><a href="v.net.timetable.html">v.net.timetable</a></td> <td>Finds shortest path using timetables.</td></tr>
<tr><td valign="top"><a href="v.net.visibility.html">v.net.visibility</a></td> <td>Performs visibility graph construction.</td></tr>
</table>
<p><em>See also the corresponding keyword <a href="keywords.html#network">network</a> for additional references.</em><hr class="header">
<p>
<a href="index.html">Main index</a> |
<a href="topics.html">Topics index</a> |
<a href="keywords.html">Keywords index</a> |
<a href="graphical_index.html">Graphical index</a> |
<a href="full_index.html">Full index</a>
</p>
<p>
xuebingbing's avatar
xuebingbing committed
46 47
&copy; 2003-2020
<a href="https://grass.osgeo.org">GRASS Development Team</a>,
xuebingbing's avatar
xuebingbing committed
48
GRASS GIS 7.8.5 Reference Manual
xuebingbing's avatar
xuebingbing committed
49 50 51 52 53
</p>

</div>
</body>
</html>