Patrick Niklaus
|
9b87b8b7b1
|
Replace deallocation vector with std::vector and different merge algorithm
|
2017-10-16 13:40:02 +01:00 |
|
Patrick Niklaus
|
61c430c098
|
Implement exclude flags on CH using shared core
The core is fully contracted for each exclude flag
and stored in a merged graph data structure.
|
2017-09-01 21:26:00 +02:00 |
|
Patrick Niklaus
|
421dc5b6ec
|
Don't return edge list in contractor but modify graph in-place
|
2017-09-01 21:26:00 +02:00 |
|
Patrick Niklaus
|
26c909b64b
|
Refactor contractor to pass in graph directly
|
2017-09-01 21:26:00 +02:00 |
|
Michael Krasnyk
|
43a7e8e08a
|
Rename {id|edge_id} to turn_id
|
2017-03-17 12:27:47 +01:00 |
|
Patrick Niklaus
|
eb2e4d0aaf
|
Load edge based graph to memory in one block and then update
|
2017-03-17 11:19:58 +00:00 |
|
Michael Krasnyk
|
f42136637d
|
Add edge-based graph loading in MLD facade
|
2017-03-08 00:56:50 +00:00 |
|
Michael Krasnyk
|
25baf51a2c
|
Add duration to edges and use it in table plugin
|
2017-01-27 11:19:37 +01:00 |
|
Patrick Niklaus
|
279f8aabfb
|
Allow specifing a weight for routing that is independent of duration
|
2017-01-27 11:19:37 +01:00 |
|
Moritz Kobitzsch
|
226ee62981
|
refactor graph contractor for readability
move to a dedicated dijkstra, separate code and header
reduce heap size, we don't use more than 2000 nodes, so why allocate 170k?
|
2017-01-18 15:03:15 +01:00 |
|