Quantum GIS API Documentation  1.8
QgsGraphAnalyzer Class Reference

The QGis class provides graph analysis functions. More...

`#include <qgsgraphanalyzer.h>`

List of all members.

## Static Public Member Functions

static void dijkstra (const QgsGraph *source, int startVertexIdx, int criterionNum, QVector< int > *resultTree=NULL, QVector< double > *resultCost=NULL)
solve shortest path problem using dijkstra algorithm
static QgsGraphshortestTree (const QgsGraph *source, int startVertexIdx, int criterionNum)
return shortest path tree with root-node in startVertexIdx

## Detailed Description

The QGis class provides graph analysis functions.

Definition at line 31 of file qgsgraphanalyzer.h.

## Member Function Documentation

 void QgsGraphAnalyzer::dijkstra ( const QgsGraph * source, int startVertexIdx, int criterionNum, QVector< int > * resultTree = `NULL`, QVector< double > * resultCost = `NULL` ) ` [static]`

solve shortest path problem using dijkstra algorithm

Parameters:
 source The source graph startVertexIdx index of start vertex criterionNum index of arc property as optimization criterion treeResult array represents the shortest path tree. resultTree[ vertexIndex ] == inboundingArcIndex if vertex reacheble and resultTree[ vertexIndex ] == -1 others. resultCost array of cost paths

Definition at line 29 of file qgsgraphanalyzer.cpp.

Referenced by shortestTree().

 QgsGraph * QgsGraphAnalyzer::shortestTree ( const QgsGraph * source, int startVertexIdx, int criterionNum ) ` [static]`

return shortest path tree with root-node in startVertexIdx

Parameters:
 source The source graph startVertexIdx index of start vertex criterionNum index of edge property as optimization criterion

Definition at line 90 of file qgsgraphanalyzer.cpp.

The documentation for this class was generated from the following files: