v.net.spanningtree(1grass)

💖 v.net.spanningtree 💖

okay so bestie, this is v.net.spanningtree — straight out of the GRASS User's Manual ✨ and it's literally the girlboss of network graphs. she computes minimum spanning tree for the network. that's it, that's the whole job, and she does it flawlessly. periodt. 💅

---

🌸 NAME 🌸

v.net.spanningtree — Computes minimum spanning tree for the network. 👑

---

🏷️ KEYWORDS 🏷️

• vector
• network
• spanning tree

---

🚀 SYNOPSIS 🚀

v.net.spanningtree
v.net.spanningtree --help
v.net.spanningtree [-g] input=name output=name  [arc_layer=string]
[node_layer=string]   [arc_column=name]   [node_column=name]
[--overwrite]  [--help]  [--verbose]  [--quiet]  [--ui]

---

🎀 Flags 🎀

• -g — Use geodesic calculation for longitude-latitude projects. globe girlie behavior 🌍
• --overwrite — Allow output files to overwrite existing files. she will absolutely replace your old file, no hesitation, no warning text 💀
• --help — Print usage summary. your lil cheat sheet 🫶
• --verbose — Verbose module output. she tells you everything 💬
• --quiet — Quiet module output. she says nothing and just delivers 🤫
• --ui — Force launching GUI dialog. pop-up moment ✨

---

🍓 Parameters 🍓

• input=name [required] — Name of input vector map. Or data source for direct OGR access.
• output=name [required] — Name for output vector map.
• arc_layer=string — Arc layer. Vector features can have category values in different layers. This number determines which layer to use. When used with direct OGR access this is the layer name.

Default: 1

• node_layer=string — Node layer. Vector features can have category values in different layers. This number determines which layer to use. When used with direct OGR access this is the layer name.

Default: 2

• arc_column=name — Arc forward/both direction(s) cost column (number).
• node_column=name — Node cost column (number).

---

✨ DESCRIPTION ✨

v.net.spanningtree finds the minimum spanning tree in a network. that's the whole vibe check and she passed it. 🔥

---

📝 NOTES 📝

okay so listen up because this part is giving "actually important":

A spanning tree is a minimum cost subnetwork connecting all nodes in an undirected network (same forward and backward costs). 🧠

If a network is disconnected then the module computes the minimum spanning tree for each (weakly) connected component. So, strictly speaking, v.net.spanningtree does not compute spanning tree but a spanning forest. 🌲🌲🌲 not me exposing the naming crime 😭

As the name suggests, a spanning tree is a tree. That is, it contains no cycles and if a component has N nodes then the tree has N-1 edges connecting all nodes. no loops, no drama, just vibes 🎀

accol is used to specify the costs of the edges. The output consists of the edges in the spanning tree. so what you get back = the edges themselves, bestie. 💅

---

🌈 EXAMPLES 🌈

Find cheapest set of pipelines connecting all nodes. frugal queen behavior fr fr 💸

v.net.spanningtree input=projected_pipelines output=spanningtree accol=cost

---

👀 SEE ALSO 👀

• v.net
• v.net.steiner

---

👑 AUTHORS 👑

• Daniel Bundala, Google Summer of Code 2009, Student
• Wolf Bergenheim, Mentor

---

💾 SOURCE CODE 💾

Available at: v.net.spanningtree source code (history)

Latest change: Friday Feb 07 19:16:09 2025 in commit: a82a39f673b97fafcfce1604dc3e6015cb96487a

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

---

and that's the whole page bestie, you ate it up, no notes 🫶✨

© 2003-2026 GRASS Development Team, GRASS 8.5.0 Reference Manual — she's literally in the GRASS 8.5.0 era and this manual was served fresh with love. mwah 💋🌸🎀