EnglishFrenchSpanish

OnWorks favicon

v.net.spanningtreegrass - Online in the Cloud

Run v.net.spanningtreegrass in OnWorks free hosting provider over Ubuntu Online, Fedora Online, Windows online emulator or MAC OS online emulator

This is the command v.net.spanningtreegrass that can be run in the OnWorks free hosting provider using one of our multiple free online workstations such as Ubuntu Online, Fedora Online, Windows online emulator or MAC OS online emulator

PROGRAM:

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 locations

--overwrite
Allow output files to overwrite existing files

--help
Print usage summary

--verbose
Verbose module output

--quiet
Quiet module output

--ui
Force launching GUI dialog

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.

NOTES


A spanning tree is a minimum cost subnetwork connecting all nodes in a network. Or, 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. 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. Accol is used to specify the costs of the edges. The output consists
of the edges in the spanning tree.

EXAMPLES


Find cheapest set of pipelines connecting all nodes.
v.net.spanningtree input=projected_pipelines output=spanningtree accol=cost

Use v.net.spanningtreegrass online using onworks.net services


Free Servers & Workstations

Download Windows & Linux apps

Linux commands

  • 1
    a2crd
    a2crd
    a2crd - attempts the conversion of
    lyrics file into chordii input ...
    Run a2crd
  • 2
    a2j
    a2j
    a2j - Wrapper script to simulate
    a2jmidid's non-DBUS behaviour though
    a2jmidid actually being in DBUS mode ...
    Run a2j
  • 3
    cowpoke
    cowpoke
    cowpoke - Build a Debian source package
    in a remote cowbuilder instance ...
    Run cowpoke
  • 4
    cp
    cp
    cp - copy files and directories ...
    Run cp
  • 5
    gbnlreg
    gbnlreg
    gbnlreg - Non linear regression ...
    Run gbnlreg
  • 6
    gbonds
    gbonds
    gbonds - U.S. savings bond inventory
    program for GNOME ...
    Run gbonds
  • More »

Ad