Class: QgsGraphAnalyzer¶
-
class
qgis.analysis.
QgsGraphAnalyzer
¶ Bases:
sip.wrapper
This class performs graph analysis, e.g. calculates shortest path between two points using different strategies with Dijkstra algorithm
Methods
Solve shortest path problem using Dijkstra algorithm
Returns shortest path tree with root-node in startVertexIdx
-
dijkstra
(source: QgsGraph, startVertexIdx: int, criterionNum: int, resultTree: Iterable[int] = [], resultCost: Iterable[float] = []) → List¶ Solve shortest path problem using Dijkstra algorithm
- Parameters
source (QgsGraph) – source graph
startVertexIdx (int) – index of the start vertex
criterionNum (int) – index of the optimization strategy
resultTree (Iterable[int] = []) – array that represents shortest path tree. resultTree[ vertexIndex ] == inboundingArcIndex if vertex reachable, otherwise resultTree[ vertexIndex ] == -1. Note that the startVertexIdx will also have a value of -1 and may need special handling by callers.
resultCost (Iterable[float] = []) – array of the paths costs
- Return type
List
-
shortestTree
(source: QgsGraph, startVertexIdx: int, criterionNum: int) → QgsGraph¶ Returns shortest path tree with root-node in startVertexIdx
-