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

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 QgsGraph *	shortestTree (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.

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
resultTree	array represents the shortest path tree. resultTree[ vertexIndex ] == inboundingArcIndex if vertex reacheble and resultTree[ vertexIndex ] == -1 others.
resultCost	array of cost paths

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

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