/
testqgsnetworkanalysis.cpp
581 lines (513 loc) · 27.1 KB
/
testqgsnetworkanalysis.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
/***************************************************************************
testqgsnetworkanalysis.cpp
--------------------------
Date : November 2017
Copyright : (C) 2017 by Nyall Dawson
Email : nyall dot dawson at gmail dot com
***************************************************************************
* *
* This program is free software; you can redistribute it and/or modify *
* it under the terms of the GNU General Public License as published by *
* the Free Software Foundation; either version 2 of the License, or *
* (at your option) any later version. *
* *
***************************************************************************/
#include "qgstest.h"
//header for class being tested
#include "qgsgeometrysnapper.h"
#include "qgsgeometry.h"
#include <qgsapplication.h>
#include "qgsvectordataprovider.h"
#include "qgsvectorlayer.h"
#include "qgsvectorlayerdirector.h"
#include "qgsnetworkdistancestrategy.h"
#include "qgsgraphbuilder.h"
#include "qgsgraph.h"
#include "qgsgraphanalyzer.h"
class TestQgsNetworkAnalysis : public QObject
{
Q_OBJECT
public:
private slots:
void initTestCase();// will be called before the first testfunction is executed.
void cleanupTestCase();// will be called after the last testfunction was executed.
void init() ;// will be called before each testfunction is executed.
void cleanup() ;// will be called after every testfunction.
void testGraph();
void testBuild();
void testBuildTolerance();
void dijkkjkjkskkjsktra();
void testRouteFail();
void testRouteFail2();
private:
std::unique_ptr< QgsVectorLayer > buildNetwork();
};
class TestNetworkStrategy : public QgsNetworkStrategy
{
QSet< int > requiredAttributes() const override
{
return QSet< int >() << 0;
}
QVariant cost( double, const QgsFeature &f ) const override
{
return f.attribute( 0 );
}
};
void TestQgsNetworkAnalysis::initTestCase()
{
//
// Runs once before any tests are run
//
// init QGIS's paths - true means that all path will be inited from prefix
QgsApplication::init();
QgsApplication::initQgis();
}
void TestQgsNetworkAnalysis::cleanupTestCase()
{
QgsApplication::exitQgis();
}
void TestQgsNetworkAnalysis::init()
{
}
void TestQgsNetworkAnalysis::cleanup()
{
}
void TestQgsNetworkAnalysis::testGraph()
{
QgsGraph graph;
QCOMPARE( graph.vertexCount(), 0 );
QCOMPARE( graph.edgeCount(), 0 );
graph.addVertex( QgsPointXY( 1, 2 ) );
QCOMPARE( graph.vertexCount(), 1 );
QCOMPARE( graph.vertex( 0 ).point(), QgsPointXY( 1, 2 ) );
QVERIFY( graph.vertex( 0 ).outgoingEdges().empty() );
QVERIFY( graph.vertex( 0 ).incomingEdges().empty() );
QCOMPARE( graph.findVertex( QgsPointXY( 1, 2 ) ), 0 );
graph.addVertex( QgsPointXY( 3, 4 ) );
QCOMPARE( graph.vertexCount(), 2 );
QCOMPARE( graph.vertex( 1 ).point(), QgsPointXY( 3, 4 ) );
QVERIFY( graph.vertex( 1 ).outgoingEdges().empty() );
QVERIFY( graph.vertex( 1 ).incomingEdges().empty() );
QCOMPARE( graph.findVertex( QgsPointXY( 1, 2 ) ), 0 );
QCOMPARE( graph.findVertex( QgsPointXY( 3, 4 ) ), 1 );
QCOMPARE( graph.edgeCount(), 0 );
graph.addEdge( 0, 1, QVector< QVariant >() << 9 );
QCOMPARE( graph.edgeCount(), 1 );
QCOMPARE( graph.edge( 0 ).cost( 0 ).toInt(), 9 );
QCOMPARE( graph.edge( 0 ).fromVertex(), 0 );
QCOMPARE( graph.edge( 0 ).toVertex(), 1 );
QCOMPARE( graph.vertex( 0 ).incomingEdges(), QList< int >() );
QCOMPARE( graph.vertex( 0 ).outgoingEdges(), QList< int >() << 0 );
QCOMPARE( graph.vertex( 1 ).incomingEdges(), QList< int >() << 0 );
QCOMPARE( graph.vertex( 1 ).outgoingEdges(), QList< int >() );
graph.addVertex( QgsPointXY( 7, 8 ) );
QCOMPARE( graph.vertexCount(), 3 );
QCOMPARE( graph.vertex( 2 ).point(), QgsPointXY( 7, 8 ) );
QVERIFY( graph.vertex( 2 ).outgoingEdges().empty() );
QVERIFY( graph.vertex( 2 ).incomingEdges().empty() );
QCOMPARE( graph.edgeCount(), 1 );
graph.addEdge( 1, 2, QVector< QVariant >() << 8 );
QCOMPARE( graph.edge( 1 ).cost( 0 ).toInt(), 8 );
QCOMPARE( graph.edge( 1 ).fromVertex(), 1 );
QCOMPARE( graph.edge( 1 ).toVertex(), 2 );
QCOMPARE( graph.vertex( 1 ).incomingEdges(), QList< int >() << 0 );
QCOMPARE( graph.vertex( 1 ).outgoingEdges(), QList< int >() << 1 );
QCOMPARE( graph.vertex( 2 ).incomingEdges(), QList< int >() << 1 );
QCOMPARE( graph.vertex( 2 ).outgoingEdges(), QList< int >() );
}
std::unique_ptr<QgsVectorLayer> TestQgsNetworkAnalysis::buildNetwork()
{
std::unique_ptr< QgsVectorLayer > l = std::make_unique< QgsVectorLayer >( QStringLiteral( "LineString?crs=epsg:4326&field=cost:int" ), QStringLiteral( "x" ), QStringLiteral( "memory" ) );
QgsFeature ff( 0 );
QgsGeometry refGeom = QgsGeometry::fromWkt( QStringLiteral( "LineString(0 0, 10 0, 10 10)" ) );
ff.setGeometry( refGeom );
ff.setAttributes( QgsAttributes() << 1 );
QgsFeatureList flist;
flist << ff;
l->dataProvider()->addFeatures( flist );
return l;
}
void TestQgsNetworkAnalysis::testBuild()
{
std::unique_ptr<QgsVectorLayer> network = buildNetwork();
std::unique_ptr< QgsVectorLayerDirector > director = std::make_unique< QgsVectorLayerDirector > ( network.get(),
-1, QString(), QString(), QString(), QgsVectorLayerDirector::DirectionBoth );
std::unique_ptr< QgsNetworkDistanceStrategy > strategy = std::make_unique< QgsNetworkDistanceStrategy >();
director->addStrategy( strategy.release() );
std::unique_ptr< QgsGraphBuilder > builder = std::make_unique< QgsGraphBuilder > ( network->sourceCrs(), true, 0 );
QVector<QgsPointXY > snapped;
director->makeGraph( builder.get(), QVector<QgsPointXY>() << QgsPointXY( 0, 0 ) << QgsPointXY( 10, 10 ), snapped );
QCOMPARE( snapped, QVector<QgsPointXY>() << QgsPointXY( 0, 0 ) << QgsPointXY( 10, 10 ) );
std::unique_ptr< QgsGraph > graph( builder->takeGraph() );
QCOMPARE( graph->vertexCount(), 3 );
QCOMPARE( graph->edgeCount(), 4 );
QCOMPARE( graph->vertex( 0 ).point(), QgsPointXY( 0, 0 ) );
QCOMPARE( graph->vertex( 0 ).outgoingEdges(), QList< int >() << 0 );
QCOMPARE( graph->edge( 0 ).fromVertex(), 0 );
QCOMPARE( graph->edge( 0 ).toVertex(), 1 );
QCOMPARE( graph->vertex( 0 ).incomingEdges(), QList< int >() << 1 );
QCOMPARE( graph->edge( 1 ).fromVertex(), 1 );
QCOMPARE( graph->edge( 1 ).toVertex(), 0 );
QCOMPARE( graph->vertex( 1 ).point(), QgsPointXY( 10, 0 ) );
QCOMPARE( graph->vertex( 1 ).outgoingEdges(), QList< int >() << 1 << 2 );
QCOMPARE( graph->vertex( 1 ).incomingEdges(), QList< int >() << 0 << 3 );
QCOMPARE( graph->edge( 3 ).fromVertex(), 2 );
QCOMPARE( graph->edge( 3 ).toVertex(), 1 );
QCOMPARE( graph->edge( 2 ).fromVertex(), 1 );
QCOMPARE( graph->edge( 2 ).toVertex(), 2 );
QCOMPARE( graph->vertex( 2 ).point(), QgsPointXY( 10, 10 ) );
QCOMPARE( graph->vertex( 2 ).outgoingEdges(), QList< int >() << 3 );
QCOMPARE( graph->vertex( 2 ).incomingEdges(), QList< int >() << 2 );
builder = std::make_unique< QgsGraphBuilder > ( network->sourceCrs(), true, 0 );
director->makeGraph( builder.get(), QVector<QgsPointXY>() << QgsPointXY( 10, 0 ) << QgsPointXY( 10, 10 ), snapped );
QCOMPARE( snapped, QVector<QgsPointXY>() << QgsPointXY( 10, 0 ) << QgsPointXY( 10, 10 ) );
builder = std::make_unique< QgsGraphBuilder > ( network->sourceCrs(), true, 0 );
director->makeGraph( builder.get(), QVector<QgsPointXY>(), snapped );
QCOMPARE( snapped, QVector<QgsPointXY>() );
builder = std::make_unique< QgsGraphBuilder > ( network->sourceCrs(), true, 0 );
director->makeGraph( builder.get(), QVector<QgsPointXY>() << QgsPointXY( 0.2, 0.1 ) << QgsPointXY( 10.1, 9 ), snapped );
QCOMPARE( snapped, QVector<QgsPointXY>() << QgsPointXY( 0.2, 0.0 ) << QgsPointXY( 10.0, 9 ) );
graph.reset( builder->takeGraph() );
QCOMPARE( graph->vertexCount(), 5 );
QCOMPARE( graph->edgeCount(), 8 );
}
void TestQgsNetworkAnalysis::testBuildTolerance()
{
std::unique_ptr<QgsVectorLayer> network = buildNetwork();
// has already a linestring LineString(0 0, 10 0, 10 10)
QgsFeature ff( 0 );
// 0.1 distance gap
QgsGeometry refGeom = QgsGeometry::fromWkt( QStringLiteral( "LineString(10.1 10, 20 10 )" ) );
ff.setGeometry( refGeom );
QgsFeatureList flist;
flist << ff;
network->dataProvider()->addFeatures( flist );
std::unique_ptr< QgsVectorLayerDirector > director = std::make_unique< QgsVectorLayerDirector > ( network.get(),
-1, QString(), QString(), QString(), QgsVectorLayerDirector::DirectionBoth );
std::unique_ptr< QgsNetworkDistanceStrategy > strategy = std::make_unique< QgsNetworkDistanceStrategy >();
director->addStrategy( strategy.release() );
std::unique_ptr< QgsGraphBuilder > builder = std::make_unique< QgsGraphBuilder > ( network->sourceCrs(), true, 0 );
QVector<QgsPointXY > snapped;
director->makeGraph( builder.get(), QVector<QgsPointXY>(), snapped );
std::unique_ptr< QgsGraph > graph( builder->takeGraph() );
QCOMPARE( graph->vertexCount(), 5 );
QCOMPARE( graph->edgeCount(), 6 );
QCOMPARE( graph->vertex( 0 ).point(), QgsPointXY( 0, 0 ) );
QCOMPARE( graph->vertex( 0 ).outgoingEdges(), QList< int >() << 0 );
QCOMPARE( graph->edge( 0 ).fromVertex(), 0 );
QCOMPARE( graph->edge( 0 ).toVertex(), 1 );
QCOMPARE( graph->vertex( 0 ).incomingEdges(), QList< int >() << 1 );
QCOMPARE( graph->edge( 1 ).fromVertex(), 1 );
QCOMPARE( graph->edge( 1 ).toVertex(), 0 );
QCOMPARE( graph->vertex( 1 ).point(), QgsPointXY( 10, 0 ) );
QCOMPARE( graph->vertex( 1 ).outgoingEdges(), QList< int >() << 1 << 2 );
QCOMPARE( graph->vertex( 1 ).incomingEdges(), QList< int >() << 0 << 3 );
QCOMPARE( graph->edge( 3 ).fromVertex(), 2 );
QCOMPARE( graph->edge( 3 ).toVertex(), 1 );
QCOMPARE( graph->edge( 2 ).fromVertex(), 1 );
QCOMPARE( graph->edge( 2 ).toVertex(), 2 );
QCOMPARE( graph->vertex( 2 ).point(), QgsPointXY( 10, 10 ) );
QCOMPARE( graph->vertex( 2 ).outgoingEdges(), QList< int >() << 3 );
QCOMPARE( graph->vertex( 2 ).incomingEdges(), QList< int >() << 2 );
QCOMPARE( graph->vertex( 3 ).point(), QgsPointXY( 10.1, 10 ) );
QCOMPARE( graph->vertex( 3 ).outgoingEdges(), QList< int >() << 4 );
QCOMPARE( graph->vertex( 3 ).incomingEdges(), QList< int >() << 5 );
QCOMPARE( graph->vertex( 4 ).point(), QgsPointXY( 20, 10 ) );
QCOMPARE( graph->edge( 5 ).fromVertex(), 4 );
QCOMPARE( graph->edge( 5 ).toVertex(), 3 );
QCOMPARE( graph->edge( 4 ).fromVertex(), 3 );
QCOMPARE( graph->edge( 4 ).toVertex(), 4 );
// with tolerance
double tolerance = 0.11;
builder = std::make_unique< QgsGraphBuilder > ( network->sourceCrs(), true, tolerance );
director->makeGraph( builder.get(), QVector<QgsPointXY>(), snapped );
graph.reset( builder->takeGraph() );
QCOMPARE( graph->vertexCount(), 4 );
QCOMPARE( graph->edgeCount(), 6 );
QCOMPARE( graph->vertex( 0 ).point(), QgsPointXY( 0, 0 ) );
QCOMPARE( graph->vertex( 0 ).outgoingEdges(), QList< int >() << 0 );
QCOMPARE( graph->edge( 0 ).fromVertex(), 0 );
QCOMPARE( graph->edge( 0 ).toVertex(), 1 );
QCOMPARE( graph->vertex( 0 ).incomingEdges(), QList< int >() << 1 );
QCOMPARE( graph->edge( 1 ).fromVertex(), 1 );
QCOMPARE( graph->edge( 1 ).toVertex(), 0 );
QCOMPARE( graph->vertex( 1 ).point(), QgsPointXY( 10, 0 ) );
QCOMPARE( graph->vertex( 1 ).outgoingEdges(), QList< int >() << 1 << 2 );
QCOMPARE( graph->vertex( 1 ).incomingEdges(), QList< int >() << 0 << 3 );
QCOMPARE( graph->edge( 3 ).fromVertex(), 2 );
QCOMPARE( graph->edge( 3 ).toVertex(), 1 );
QCOMPARE( graph->edge( 2 ).fromVertex(), 1 );
QCOMPARE( graph->edge( 2 ).toVertex(), 2 );
QCOMPARE( graph->vertex( 2 ).point(), QgsPointXY( 10, 10 ) );
QCOMPARE( graph->vertex( 2 ).outgoingEdges(), QList< int >() << 3 << 4 );
QCOMPARE( graph->vertex( 2 ).incomingEdges(), QList< int >() << 2 << 5 );
QCOMPARE( graph->vertex( 3 ).point(), QgsPointXY( 20, 10 ) );
QCOMPARE( graph->vertex( 3 ).outgoingEdges(), QList< int >() << 5 );
QCOMPARE( graph->vertex( 3 ).incomingEdges(), QList< int >() << 4 );
QCOMPARE( graph->edge( 5 ).fromVertex(), 3 );
QCOMPARE( graph->edge( 5 ).toVertex(), 2 );
QCOMPARE( graph->edge( 4 ).fromVertex(), 2 );
QCOMPARE( graph->edge( 4 ).toVertex(), 3 );
}
void TestQgsNetworkAnalysis::dijkkjkjkskkjsktra()
{
std::unique_ptr<QgsVectorLayer> network = buildNetwork();
// has already a linestring LineString(0 0, 10 0, 10 10)
// add some more lines to network
QgsFeature ff( 0 );
QgsFeatureList flist;
ff.setGeometry( QgsGeometry::fromWkt( QStringLiteral( "LineString(10 10, 20 10 )" ) ) );
ff.setAttributes( QgsAttributes() << 2 );
flist << ff;
ff.setGeometry( QgsGeometry::fromWkt( QStringLiteral( "LineString(10 20, 10 10 )" ) ) );
ff.setAttributes( QgsAttributes() << 3 );
flist << ff;
ff.setGeometry( QgsGeometry::fromWkt( QStringLiteral( "LineString(20 -10, 20 10 )" ) ) );
ff.setAttributes( QgsAttributes() << 4 );
flist << ff;
network->dataProvider()->addFeatures( flist );
/*
Out network is:
Numbers in brackets are cost for segment
20 o
|
v (3)
| (2)
10 o---->----o
| |
(1) ^ ^
(1) | |
0 o---->-----. |(4)
|
^
|
-10 o
0 10 20
*/
// build graph
std::unique_ptr< QgsVectorLayerDirector > director = std::make_unique< QgsVectorLayerDirector > ( network.get(),
-1, QString(), QString(), QString(), QgsVectorLayerDirector::DirectionBoth );
std::unique_ptr< QgsNetworkStrategy > strategy = std::make_unique< TestNetworkStrategy >();
director->addStrategy( strategy.release() );
std::unique_ptr< QgsGraphBuilder > builder = std::make_unique< QgsGraphBuilder > ( network->sourceCrs(), true, 0 );
QVector<QgsPointXY > snapped;
director->makeGraph( builder.get(), QVector<QgsPointXY>(), snapped );
std::unique_ptr< QgsGraph > graph( builder->takeGraph() );
int startVertexIdx = graph->findVertex( QgsPointXY( 20, -10 ) );
QVERIFY( startVertexIdx != -1 );
// both directions
QVector<int> resultTree;
QVector<double> resultCost;
QgsGraphAnalyzer::dijkstra( graph.get(), startVertexIdx, 0, &resultTree, &resultCost );
int point_0_0_idx = graph->findVertex( QgsPointXY( 0, 0 ) );
QVERIFY( point_0_0_idx != -1 );
int point_10_0_idx = graph->findVertex( QgsPointXY( 10, 0 ) );
QVERIFY( point_10_0_idx != -1 );
int point_10_10_idx = graph->findVertex( QgsPointXY( 10, 10 ) );
QVERIFY( point_10_10_idx != -1 );
int point_10_20_idx = graph->findVertex( QgsPointXY( 10, 20 ) );
QVERIFY( point_10_20_idx != -1 );
int point_20_10_idx = graph->findVertex( QgsPointXY( 20, 10 ) );
QVERIFY( point_20_10_idx != -1 );
QCOMPARE( resultTree.at( startVertexIdx ), -1 );
QCOMPARE( resultCost.at( startVertexIdx ), 0.0 );
QVERIFY( resultTree.at( point_20_10_idx ) != -1 );
QCOMPARE( resultCost.at( point_20_10_idx ), 4.0 );
QCOMPARE( graph->edge( resultTree.at( point_20_10_idx ) ).fromVertex(), startVertexIdx );
QCOMPARE( graph->edge( resultTree.at( point_20_10_idx ) ).toVertex(), point_20_10_idx );
QVERIFY( resultTree.at( point_10_10_idx ) != -1 );
QCOMPARE( resultCost.at( point_10_10_idx ), 6.0 );
QCOMPARE( graph->edge( resultTree.at( point_10_10_idx ) ).fromVertex(), point_20_10_idx );
QCOMPARE( graph->edge( resultTree.at( point_10_10_idx ) ).toVertex(), point_10_10_idx );
QVERIFY( resultTree.at( point_10_20_idx ) != -1 );
QCOMPARE( resultCost.at( point_10_20_idx ), 9.0 );
QCOMPARE( graph->edge( resultTree.at( point_10_20_idx ) ).fromVertex(), point_10_10_idx );
QCOMPARE( graph->edge( resultTree.at( point_10_20_idx ) ).toVertex(), point_10_20_idx );
QVERIFY( resultTree.at( point_10_0_idx ) != -1 );
QCOMPARE( resultCost.at( point_10_0_idx ), 7.0 );
QCOMPARE( graph->edge( resultTree.at( point_10_0_idx ) ).fromVertex(), point_10_10_idx );
QCOMPARE( graph->edge( resultTree.at( point_10_0_idx ) ).toVertex(), point_10_0_idx );
QVERIFY( resultTree.at( point_0_0_idx ) != -1 );
QCOMPARE( resultCost.at( point_0_0_idx ), 8.0 );
QCOMPARE( graph->edge( resultTree.at( point_0_0_idx ) ).fromVertex(), point_10_0_idx );
QCOMPARE( graph->edge( resultTree.at( point_0_0_idx ) ).toVertex(), point_0_0_idx );
// forward direction
director = std::make_unique< QgsVectorLayerDirector > ( network.get(),
-1, QString(), QString(), QString(), QgsVectorLayerDirector::DirectionForward );
strategy = std::make_unique< TestNetworkStrategy >();
director->addStrategy( strategy.release() );
builder = std::make_unique< QgsGraphBuilder > ( network->sourceCrs(), true, 0 );
director->makeGraph( builder.get(), QVector<QgsPointXY>(), snapped );
graph.reset( builder->takeGraph() );
startVertexIdx = graph->findVertex( QgsPointXY( 0, 0 ) );
QVERIFY( startVertexIdx != -1 );
resultTree.clear();
resultCost.clear();
QgsGraphAnalyzer::dijkstra( graph.get(), startVertexIdx, 0, &resultTree, &resultCost );
point_0_0_idx = graph->findVertex( QgsPointXY( 0, 0 ) );
QVERIFY( point_0_0_idx != -1 );
point_10_0_idx = graph->findVertex( QgsPointXY( 10, 0 ) );
QVERIFY( point_10_0_idx != -1 );
point_10_10_idx = graph->findVertex( QgsPointXY( 10, 10 ) );
QVERIFY( point_10_10_idx != -1 );
point_10_20_idx = graph->findVertex( QgsPointXY( 10, 20 ) );
QVERIFY( point_10_20_idx != -1 );
point_20_10_idx = graph->findVertex( QgsPointXY( 20, 10 ) );
QVERIFY( point_20_10_idx != -1 );
int point_20_n10_idx = graph->findVertex( QgsPointXY( 20, -10 ) );
QVERIFY( point_20_n10_idx != -1 );
QCOMPARE( resultTree.at( startVertexIdx ), -1 );
QCOMPARE( resultCost.at( startVertexIdx ), 0.0 );
QVERIFY( resultTree.at( point_10_0_idx ) != -1 );
QCOMPARE( resultCost.at( point_10_0_idx ), 1.0 );
QCOMPARE( graph->edge( resultTree.at( point_10_0_idx ) ).fromVertex(), startVertexIdx );
QCOMPARE( graph->edge( resultTree.at( point_10_0_idx ) ).toVertex(), point_10_0_idx );
QVERIFY( resultTree.at( point_10_10_idx ) != -1 );
QCOMPARE( resultCost.at( point_10_10_idx ), 2.0 );
QCOMPARE( graph->edge( resultTree.at( point_10_10_idx ) ).fromVertex(), point_10_0_idx );
QCOMPARE( graph->edge( resultTree.at( point_10_10_idx ) ).toVertex(), point_10_10_idx );
QCOMPARE( resultTree.at( point_10_20_idx ), -1 ); // unreachable
QVERIFY( resultTree.at( point_20_10_idx ) != -1 );
QCOMPARE( resultCost.at( point_20_10_idx ), 4.0 );
QCOMPARE( graph->edge( resultTree.at( point_20_10_idx ) ).fromVertex(), point_10_10_idx );
QCOMPARE( graph->edge( resultTree.at( point_20_10_idx ) ).toVertex(), point_20_10_idx );
QCOMPARE( resultTree.at( point_20_n10_idx ), -1 ); // unreachable
// backward direction
director = std::make_unique< QgsVectorLayerDirector > ( network.get(),
-1, QString(), QString(), QString(), QgsVectorLayerDirector::DirectionBackward );
strategy = std::make_unique< TestNetworkStrategy >();
director->addStrategy( strategy.release() );
builder = std::make_unique< QgsGraphBuilder > ( network->sourceCrs(), true, 0 );
director->makeGraph( builder.get(), QVector<QgsPointXY>(), snapped );
graph.reset( builder->takeGraph() );
startVertexIdx = graph->findVertex( QgsPointXY( 10, 10 ) );
QVERIFY( startVertexIdx != -1 );
resultTree.clear();
resultCost.clear();
QgsGraphAnalyzer::dijkstra( graph.get(), startVertexIdx, 0, &resultTree, &resultCost );
point_0_0_idx = graph->findVertex( QgsPointXY( 0, 0 ) );
QVERIFY( point_0_0_idx != -1 );
point_10_0_idx = graph->findVertex( QgsPointXY( 10, 0 ) );
QVERIFY( point_10_0_idx != -1 );
point_10_10_idx = graph->findVertex( QgsPointXY( 10, 10 ) );
QVERIFY( point_10_10_idx != -1 );
point_10_20_idx = graph->findVertex( QgsPointXY( 10, 20 ) );
QVERIFY( point_10_20_idx != -1 );
point_20_10_idx = graph->findVertex( QgsPointXY( 20, 10 ) );
QVERIFY( point_20_10_idx != -1 );
point_20_n10_idx = graph->findVertex( QgsPointXY( 20, -10 ) );
QVERIFY( point_20_n10_idx != -1 );
QCOMPARE( resultTree.at( startVertexIdx ), -1 );
QCOMPARE( resultCost.at( startVertexIdx ), 0.0 );
QCOMPARE( resultTree.at( point_20_10_idx ), -1 );
QCOMPARE( resultTree.at( point_20_n10_idx ), -1 );
QVERIFY( resultTree.at( point_10_20_idx ) != -1 );
QCOMPARE( resultCost.at( point_10_20_idx ), 3.0 );
QCOMPARE( graph->edge( resultTree.at( point_10_20_idx ) ).fromVertex(), startVertexIdx );
QCOMPARE( graph->edge( resultTree.at( point_10_20_idx ) ).toVertex(), point_10_20_idx );
QVERIFY( resultTree.at( point_10_0_idx ) != -1 );
QCOMPARE( resultCost.at( point_10_0_idx ), 1.0 );
QCOMPARE( graph->edge( resultTree.at( point_10_0_idx ) ).fromVertex(), startVertexIdx );
QCOMPARE( graph->edge( resultTree.at( point_10_0_idx ) ).toVertex(), point_10_0_idx );
QVERIFY( resultTree.at( point_0_0_idx ) != -1 );
QCOMPARE( resultCost.at( point_0_0_idx ), 2.0 );
QCOMPARE( graph->edge( resultTree.at( point_0_0_idx ) ).fromVertex(), point_10_0_idx );
QCOMPARE( graph->edge( resultTree.at( point_0_0_idx ) ).toVertex(), point_0_0_idx );
}
void TestQgsNetworkAnalysis::testRouteFail()
{
std::unique_ptr< QgsVectorLayer > network = std::make_unique< QgsVectorLayer >( QStringLiteral( "LineString?crs=epsg:28355&field=cost:int" ), QStringLiteral( "x" ), QStringLiteral( "memory" ) );
QStringList lines = QStringList() << QStringLiteral( "LineString (302081.71116495534079149 5753475.15082756895571947, 302140.54234686412382871 5753417.70564490929245949, 302143.24717211339157075 5753412.57312887348234653, 302143.17789465241366997 5753406.77192200440913439, 302140.35127420048229396 5753401.70546196680516005, 302078.46200818457873538 5753338.31098813004791737, 302038.17299743194598705 5753309.50200006738305092)" )
<< QStringLiteral( "LineString (302081.70763194985920563 5753475.1403581602498889, 301978.24500802176771685 5753368.03299263771623373)" )
<< QStringLiteral( "LineString (302181.69117977644782513 5753576.27856593858450651, 302081.71834095334634185 5753475.14562766999006271)" );
QgsFeatureList flist;
for ( const QString &line : lines )
{
QgsFeature ff( 0 );
QgsGeometry refGeom = QgsGeometry::fromWkt( line );
ff.setGeometry( refGeom );
ff.setAttributes( QgsAttributes() << 1 );
flist << ff;
}
network->dataProvider()->addFeatures( flist );
// build graph
std::unique_ptr< QgsVectorLayerDirector > director = std::make_unique< QgsVectorLayerDirector > ( network.get(),
-1, QString(), QString(), QString(), QgsVectorLayerDirector::DirectionBoth );
std::unique_ptr< QgsNetworkStrategy > strategy = std::make_unique< TestNetworkStrategy >();
director->addStrategy( strategy.release() );
std::unique_ptr< QgsGraphBuilder > builder = std::make_unique< QgsGraphBuilder > ( network->sourceCrs(), true, 1 );
QgsPointXY start( 302131.1053754404, 5753392.757948928 );
QgsPointXY end( 302148.1636281528, 5753541.408436851 );
QVector<QgsPointXY > snapped;
director->makeGraph( builder.get(), QVector<QgsPointXY>() << start << end, snapped );
std::unique_ptr< QgsGraph > graph( builder->takeGraph() );
QgsPointXY snappedStart = snapped.at( 0 );
QGSCOMPARENEAR( snappedStart.x(), 302131.3, 0.1 );
QGSCOMPARENEAR( snappedStart.y(), 5753392.5, 0.1 );
int startVertexIdx = graph->findVertex( snappedStart );
QVERIFY( startVertexIdx != -1 );
QgsPointXY snappedEnd = snapped.at( 1 );
QGSCOMPARENEAR( snappedEnd.x(), 302147.68, 0.1 );
QGSCOMPARENEAR( snappedEnd.y(), 5753541.88, 0.1 );
int endVertexIdx = graph->findVertex( snappedEnd );
QVERIFY( endVertexIdx != -1 );
// both directions
QVector<int> resultTree;
QVector<double> resultCost;
QgsGraphAnalyzer::dijkstra( graph.get(), startVertexIdx, 0, &resultTree, &resultCost );
QCOMPARE( resultTree.at( startVertexIdx ), -1 );
QCOMPARE( resultCost.at( startVertexIdx ), 0.0 );
QVERIFY( resultTree.at( endVertexIdx ) != -1 );
QCOMPARE( resultCost.at( endVertexIdx ), 6.0 );
}
void TestQgsNetworkAnalysis::testRouteFail2()
{
std::unique_ptr< QgsVectorLayer > network = std::make_unique< QgsVectorLayer >( QStringLiteral( "LineString?crs=epsg:4326&field=cost:double" ), QStringLiteral( "x" ), QStringLiteral( "memory" ) );
QStringList lines = QStringList() << QStringLiteral( "LineString (11.25044997999680874 48.42605439713970128, 11.25044693759680925 48.42603339773970106, 11.25044760759680962 48.42591690773969759, 11.25052289759680946 48.42589190773969676)" )
<< QStringLiteral( "LineString (11.25052289759680946 48.42589190773969676, 11.25050350759680917 48.42586202773969717, 11.25047190759680937 48.42581754773969749, 11.2504146475968092 48.42573849773970096, 11.25038716759680923 48.42569834773969717, 11.2502920175968093 48.42557470773969897, 11.25019984759680902 48.42560406773969817, 11.25020393759680992 48.42571203773970012, 11.2502482875968095 48.42577478773969801, 11.25021922759680848 48.42578442773969982)" )
<< QStringLiteral( "LineString (11.2504146475968092 48.42573849773970096, 11.25048389759681022 48.42572031773969599, 11.25051325759680942 48.42570672773970131)" )
<< QStringLiteral( "LineString (11.25038716759680923 48.42569834773969717, 11.25055288759680927 48.42564748773969541, 11.25052296759680992 48.42560921773969795)" );
QgsFeatureList flist;
int i = 0;
for ( const QString &line : lines )
{
QgsFeature ff( 0 );
QgsGeometry refGeom = QgsGeometry::fromWkt( line );
ff.setGeometry( refGeom );
ff.setAttributes( QgsAttributes() << 1 + 0.001 * i );
i++;
flist << ff;
}
network->dataProvider()->addFeatures( flist );
// build graph
std::unique_ptr< QgsVectorLayerDirector > director = std::make_unique< QgsVectorLayerDirector > ( network.get(),
-1, QString(), QString(), QString(), QgsVectorLayerDirector::DirectionBoth );
std::unique_ptr< QgsNetworkStrategy > strategy = std::make_unique< TestNetworkStrategy >();
director->addStrategy( strategy.release() );
std::unique_ptr< QgsGraphBuilder > builder = std::make_unique< QgsGraphBuilder > ( network->sourceCrs(), true, 0 );
QgsPointXY start( 11.250443581846053, 48.42605665308498 );
QgsPointXY end( 11.250525546822013, 48.42561343506683 );
QVector<QgsPointXY > snapped;
director->makeGraph( builder.get(), QVector<QgsPointXY>() << start << end, snapped );
std::unique_ptr< QgsGraph > graph( builder->takeGraph() );
QgsPointXY snappedStart = snapped.at( 0 );
QGSCOMPARENEAR( snappedStart.x(), 11.250450, 0.000001 );
QGSCOMPARENEAR( snappedStart.y(), 48.426054, 0.000001 );
int startVertexIdx = graph->findVertex( snappedStart );
QVERIFY( startVertexIdx != -1 );
QgsPointXY snappedEnd = snapped.at( 1 );
QGSCOMPARENEAR( snappedEnd.x(), 11.250526, 0.000001 );
QGSCOMPARENEAR( snappedEnd.y(), 48.425613, 0.000001 );
int endVertexIdx = graph->findVertex( snappedEnd );
QVERIFY( endVertexIdx != -1 );
// both directions
QVector<int> resultTree;
QVector<double> resultCost;
QgsGraphAnalyzer::dijkstra( graph.get(), startVertexIdx, 0, &resultTree, &resultCost );
QCOMPARE( resultTree.at( startVertexIdx ), -1 );
QCOMPARE( resultCost.at( startVertexIdx ), 0.0 );
QVERIFY( resultTree.at( endVertexIdx ) != -1 );
QCOMPARE( resultCost.at( endVertexIdx ), 9.01 );
}
QGSTEST_MAIN( TestQgsNetworkAnalysis )
#include "testqgsnetworkanalysis.moc"