View source: R/grass_v_net_salesman.R
grass_v_net_salesman | R Documentation |
QGIS Algorithm provided by GRASS v.net.salesman (grass:v.net.salesman). Creates a cycle connecting given nodes (Traveling salesman problem)
grass_v_net_salesman(
input = qgisprocess:::qgis_default_value(),
points = qgisprocess:::qgis_default_value(),
threshold = qgisprocess:::qgis_default_value(),
arc_type = qgisprocess:::qgis_default_value(),
center_cats = qgisprocess:::qgis_default_value(),
arc_column = qgisprocess:::qgis_default_value(),
arc_backward_column = qgisprocess:::qgis_default_value(),
.g = qgisprocess:::qgis_default_value(),
output = qgisprocess:::qgis_default_value(),
sequence = qgisprocess:::qgis_default_value(),
GRASS_REGION_PARAMETER = qgisprocess:::qgis_default_value(),
GRASS_SNAP_TOLERANCE_PARAMETER = qgisprocess:::qgis_default_value(),
GRASS_MIN_AREA_PARAMETER = qgisprocess:::qgis_default_value(),
GRASS_OUTPUT_TYPE_PARAMETER = qgisprocess:::qgis_default_value(),
GRASS_VECTOR_DSCO = qgisprocess:::qgis_default_value(),
GRASS_VECTOR_LCO = qgisprocess:::qgis_default_value(),
GRASS_VECTOR_EXPORT_NOCAT = qgisprocess:::qgis_default_value(),
...,
.complete_output = .complete_output_option(),
.quiet = .quiet_option(),
.messages = .message_option()
)
input |
|
points |
|
threshold |
|
arc_type |
|
center_cats |
|
arc_column |
|
arc_backward_column |
|
.g |
|
output |
|
sequence |
|
GRASS_REGION_PARAMETER |
|
GRASS_SNAP_TOLERANCE_PARAMETER |
|
GRASS_MIN_AREA_PARAMETER |
|
GRASS_OUTPUT_TYPE_PARAMETER |
|
GRASS_VECTOR_DSCO |
|
GRASS_VECTOR_LCO |
|
GRASS_VECTOR_EXPORT_NOCAT |
|
... |
further parameters passed to |
.complete_output |
logical specifying if complete out of |
.quiet |
logical specifying if parameter |
.messages |
logical specifying if messages from |
output - outputVector - Network_Salesman
sequence - outputFile - Output file holding node sequence
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.