topic_network(1grass)

📦
version 8.5.0 · 9 versions
, in alpine 3.24, ubuntu stonking

💖 topic_network — bestie edition 💖

okay so you found the GRASS User's Manual page for network stuff, and honestly? this whole topic ate. it's a whole ✨family✨ of modules for doing graph theory on your vector maps — paths, flows, trees, bridges, the works. grab a snack, we're going through all of them. 🍓

🌐 Topic: network

seventeen modules, no skips, here's the whole roster 🫶

  • d.path — finds the shortest path between the starting node and ending node you picked. one lil trip, plotted out. ✨
  • v.net.alloc — allocates subnets to their nearest centers. everyone gets assigned to their closest fave. 💅
  • v.net.allpairs — computes the shortest path between all pairs of nodes in the network. every combo, every node. it's giving thorough.
  • v.net.bridge — computes the bridges and the articulation points in the network. the fragile spots, exposed. 💀
  • v.net.centrality — computes degree, centrality, betweeness, closeness and eigenvector centrality measures in the network. five measures, one slay. 👑
  • v.net.components — computes the strongly connected components and the weakly connected components in the network.
  • v.net.connectivity — computes the vertex connectivity between two sets of nodes in the network.
  • v.net.distance — computes the shortest distance via the network between the given sets of features.
  • v.net.flow — computes the maximum flow between two sets of nodes in the network. 🌊
  • v.net — performs network maintenance. the responsible one. the mom friend of the group. 🎀
  • v.net.iso — splits subnets for nearest centers by cost isolines.
  • v.net.path — finds the shortest path on a vector network.
  • v.net.salesman — creates a cycle connecting the given nodes (that's the Traveling salesman problem, iykyk). 🚗
  • v.net.spanningtree — computes the minimum spanning tree for the network. 🌳 literally a tree, iconic.
  • v.net.steiner — creates a Steiner tree for the network and the given terminals.
  • v.net.timetable — finds the shortest path using timetables. schedule girlies, this one's for you. 🕐
  • v.net.visibility — performs visibility graph construction. 👀
💡 also, bestie — see also the corresponding keyword network for additional references. there's more where this came from, fr fr.

and if you wanna go explore on your own, the indexes are right there:

  • Main index | Topics index | Keywords index | Graphical index | Full index 🌈
🧚 that's the whole page. no cap. go build a network, you've got this. 💜

© 2003-2026 GRASS Development Team, GRASS 8.5.0 Reference Manual — so yeah, this whole thing is brought to you by the GRASS Development Team, and this very page is from the GRASS 8.5.0 Reference Manual. stan. 💖✨🦋

📦 where this page comes from