Patrick Niklaus
|
7345dc6861
|
Move graph compression code outside of EBGF
|
2015-07-01 18:07:29 +02:00 |
|
Patrick Niklaus
|
9958937fd1
|
At least check 4*LEAF_SIZE edges before returning none.
|
2015-07-01 17:57:03 +02:00 |
|
Andreas Gruß
|
9b0d3dfaeb
|
polyline string as parameter added
|
2015-06-02 12:09:46 +02:00 |
|
Patrick Niklaus
|
2777d53a12
|
Direct edges in contractor correctly and add better graph validation.
|
2015-06-01 17:22:12 +02:00 |
|
Patrick Niklaus
|
3065de63dd
|
Move renumbering and edge deduplication in extractor
|
2015-06-01 17:22:12 +02:00 |
|
Patrick Niklaus
|
a57fb4f1ab
|
First step into overhauling the edge storage
|
2015-06-01 17:22:12 +02:00 |
|
Patrick Niklaus
|
4cab617c25
|
Fix Coverity issue by initializing member
|
2015-05-29 09:13:28 +02:00 |
|
Patrick Niklaus
|
17a4463f59
|
More assertions
|
2015-05-28 15:18:48 +02:00 |
|
Patrick Niklaus
|
1164a65df8
|
Refactor processing_chain by splitting into sub functions
|
2015-05-28 15:18:48 +02:00 |
|
Patrick Niklaus
|
5c0a964321
|
Remove unused code SimpleNodeBasedDynamicGraph
|
2015-05-28 12:43:55 +02:00 |
|
Patrick Niklaus
|
4c03ace9eb
|
Remove pruning in IncrementalFindPhantomNode
|
2015-05-25 02:07:01 +02:00 |
|
Patrick Niklaus
|
fd9bb3ac43
|
Only activate pruning for big cc after one was found
|
2015-05-18 09:41:41 +02:00 |
|
Patrick Niklaus
|
1b0d8739c1
|
Increase max distance to 1100 to fix unrelated test cases
|
2015-05-15 00:34:34 +02:00 |
|
Patrick Niklaus
|
c4c6ab2494
|
Use distance based search radius
This limits the nearest neighbour search to a maximum distance
of 1000 meters, but will also work in dense areas.
|
2015-05-14 22:24:07 +02:00 |
|
Patrick Niklaus
|
345dd2481b
|
Add documentation to InputRestrictionContainer
|
2015-04-21 20:00:58 +02:00 |
|
Patrick Niklaus
|
006bcc0fc8
|
Add some documentation to the restriction parser
|
2015-04-21 20:00:58 +02:00 |
|
Patrick Niklaus
|
52592b84fd
|
Add functions to find reverse edge to DynamicGraph
|
2015-04-17 00:22:51 +02:00 |
|
Patrick Niklaus
|
f2cd68e3ec
|
Return SPECIAL_EDGEID if no edge was found
|
2015-04-17 00:21:57 +02:00 |
|
Dennis Luxen
|
aff590a44d
|
make implementation of FindEdge consistent among graph implementations, introduce FindSmallestEdge() function to return the edge with smallest weight if there are multiple, fixes #1427
|
2015-04-16 16:12:08 +02:00 |
|
Dennis Luxen
|
0eb2106067
|
reorder includes, add tuple include
|
2015-04-16 14:30:52 +02:00 |
|
Dennis Luxen
|
c03aec364c
|
add comparison tool for graph classes
|
2015-04-16 11:25:43 +02:00 |
|
Patrick Niklaus
|
a372ade7ce
|
Mark suspicious transitions
|
2015-04-13 22:39:55 +02:00 |
|
Dennis Luxen
|
8ee82d1e03
|
replace old-style typefs with using
|
2015-03-23 17:06:10 +01:00 |
|
Patrick Niklaus
|
028fad94af
|
Fix overflows when handling size_t
|
2015-03-08 00:53:15 +01:00 |
|
Dennis Luxen
|
b9922bc90b
|
replace C-style comments
|
2015-03-03 17:43:37 +01:00 |
|
Dennis Luxen
|
133e382aae
|
remove constexpr qualifier as numeric_limits is not yet constexpr on MSVC compiler
|
2015-03-03 14:43:38 +01:00 |
|
Dennis Luxen
|
5af0ceb2d2
|
use range based for loop
|
2015-03-03 14:22:27 +01:00 |
|
Dennis Luxen
|
6460fdc62b
|
use std::size_t for timestamps to avoid implicit casts, use range-based for loops
|
2015-03-03 13:03:00 +01:00 |
|
Dennis Luxen
|
a9c3b343fc
|
separate model and computation in HMM matching
|
2015-03-03 12:48:33 +01:00 |
|
Patrick Niklaus
|
e5830b0116
|
Add parameters for map matching
|
2015-03-03 00:48:57 +01:00 |
|
Patrick Niklaus
|
70703c39f3
|
Add timestamp parameters and reset to beginning of breakage
|
2015-03-03 00:48:57 +01:00 |
|
Patrick Niklaus
|
f092fc3fc6
|
Fix minimum number of candidates
|
2015-03-03 00:48:56 +01:00 |
|
Patrick Niklaus
|
3a5e41ed91
|
Implement missing matching pieces
|
2015-03-03 00:48:55 +01:00 |
|
Dennis Luxen
|
2259bce05f
|
Add skeleton code for matching
|
2015-03-03 00:48:55 +01:00 |
|
Dennis Luxen
|
73a2a938b4
|
use CRTP instead of virtual functions in routing plugins
|
2015-03-02 11:55:55 +01:00 |
|
Dennis Luxen
|
dc08c516bf
|
use std::tie() to simplify lexicographic comparisons
|
2015-02-19 19:15:16 +01:00 |
|
Dennis Luxen
|
b0f9a0feb4
|
rename variable name to be a little more telling
|
2015-02-19 10:11:49 +01:00 |
|
Dennis Luxen
|
3bd27ae8c5
|
change copyright line from personal names to project
|
2015-02-19 09:19:51 +01:00 |
|
Dennis Luxen
|
e5f12347bd
|
simplify code by using new phantom node ctor
|
2015-02-13 14:26:19 +01:00 |
|
Dennis Luxen
|
86d3556c6d
|
add ctor that converts from rtree segment to phantom node
|
2015-02-13 14:24:05 +01:00 |
|
Dennis Luxen
|
56b6d928b6
|
add include to be self-sufficient
|
2015-02-10 12:34:13 +01:00 |
|
Dennis Luxen
|
b865bea482
|
fix floating point comparison, remove superflous inline keywords
|
2015-02-10 12:29:52 +01:00 |
|
Dennis Luxen
|
00e8caa0e3
|
fix signed/unsigned comparisons and casts
|
2015-02-10 12:08:17 +01:00 |
|
Dennis Luxen
|
858245db7d
|
fix warning: implicit signed/unsigned warning
|
2015-02-10 11:58:56 +01:00 |
|
Dennis Luxen
|
09bea2ad5b
|
fix warning: implicit float/double cast
|
2015-02-10 11:32:39 +01:00 |
|
Dennis Luxen
|
5a1ff4b50d
|
fix warning: implicit conversion changes signedness: 'int' to 'unsigned int'
|
2015-02-10 11:09:51 +01:00 |
|
Dennis Luxen
|
e0f8acf733
|
make constant a float to avoid implicit cast
|
2015-02-10 11:04:49 +01:00 |
|
Dennis Luxen
|
f67eeb66aa
|
untangle includes using iwyu
|
2015-02-09 17:38:40 +01:00 |
|
Dennis Luxen
|
bf76465029
|
use C++11s std::hypot() instead of hand-rolled code
|
2015-02-05 11:22:46 +01:00 |
|
Dennis Luxen
|
b20b7e65bf
|
renamed: Util/* -> util/*
|
2015-01-27 17:47:23 +01:00 |
|