

Maximum On Shortest Path

Summary

Search nearest target from each input point, and record the maximum cost of the edges being traversed.

Tags:
graph, lateral continuity

Usage

No Description Yet.

Parameters

Parameter	Description	Type
Nodes INPUT		QgsProcessingParameterFeatureSource
Primary Key PK_FIELD	Default value: GID	QgsProcessingParameterField
Node/Target Field NODE_TYPE_FIELD	Default value: HYDRO	QgsProcessingParameterField
Grpah/edges EDGES		QgsProcessingParameterFeatureSource
From Node Field FROM_NODE_FIELD	Default value: A	QgsProcessingParameterField
To Node Field TO_NODE_FIELD	Default value: B	QgsProcessingParameterField
Weight Field WEIGHT_FIELD	Default value: cost	QgsProcessingParameterField
Graph Type GRAPH_TYPE		QgsProcessingParameterEnum
Maximum Cost OUTPUT		QgsProcessingParameterFeatureSink