sharpetronics/QGIS
1
0
Fork 0
mirror of https://github.com/qgis/QGIS.git synced 2025-04-13 00:03:09 -04:00
Code Issues Packages Projects Releases Wiki Activity

fix qgsgraphanalyzer.h for sipification

Browse Source
This commit is contained in:
Alexander Bruy 2017-05-03 09:11:43 +03:00 committed by Denis Rouzaud
parent 31cd113b55
commit fd9569febe
3 changed files with 2 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
python/analysis/network/qgsgraphanalyzer.sip
View File

@ -22,7 +22,7 @@ class QgsGraphAnalyzer
%End
public:
static SIP_PYLIST void dijkstra( const QgsGraph *source, int startVertexIdx, int criterionNum, QVector<int> *resultTree = 0, QVector<double> *resultCost = 0 );
static SIP_PYLIST dijkstra( const QgsGraph *source, int startVertexIdx, int criterionNum, QVector<int> *resultTree = 0, QVector<double> *resultCost = 0 );
%Docstring
Solve shortest path problem using Dijkstra algorithm
\param source source graph

2
src/analysis/network/qgsgraphanalyzer.h
View File

@ -38,7 +38,7 @@ class ANALYSIS_EXPORT QgsGraphAnalyzer
* \param resultTree array that represents shortest path tree. resultTree[ vertexIndex ] == inboundingArcIndex if vertex reachable, otherwise resultTree[ vertexIndex ] == -1
* \param resultCost array of the paths costs
*/
static SIP_PYLIST void dijkstra( const QgsGraph *source, int startVertexIdx, int criterionNum, QVector<int> *resultTree = nullptr, QVector<double> *resultCost = nullptr );
static void SIP_PYTYPE( SIP_PYLIST ) dijkstra( const QgsGraph *source, int startVertexIdx, int criterionNum, QVector<int> *resultTree = nullptr, QVector<double> *resultCost = nullptr );
#ifdef SIP_RUN
% MethodCode

6
src/core/qgis.h
View File

@ -506,9 +506,3 @@ typedef unsigned long long qgssize;
* Class level annotation for abstract classes
*/
#define SIP_ABSTRACT
/*
* This is a PyObject * that is a Python list object
* http://pyqt.sourceforge.net/Docs/sip4/specification_files.html#additional-sip-types
*/
#define SIP_PYLIST