Moritz Kobitzsch 561b7cc58e Rember Intersection Shapes ... Changes the processing order in the edge based graph factory. Instead of iterating over all outgoing edges in order, we compute the edge expanded graph in the order of intersections. This allows to remember intersection shapes and re-use them for all possible ingoing edges. Also: use low accuracry mode for intersections degree 2 intersections We can use lower accuracy here, since the `bearing` after the turn is not as relevant for off-route detection. Getting lost is near impossible here.		2016-12-01 15:24:20 +01:00
..
bearing.cpp	Fixes bearing range of zero exhaustive graph traversal	2016-09-08 17:33:50 +02:00
binary_heap.cpp	Format with clang-format 3.8	2016-05-27 21:05:04 +02:00
coordinate_calculation.cpp	Use mmap instead of read - it's a lot faster here.	2016-06-27 17:24:30 -07:00
duration_parsing.cpp	Format with clang-format 3.8	2016-05-27 21:05:04 +02:00
dynamic_graph.cpp	Format with clang-format 3.8	2016-05-27 21:05:04 +02:00
group_by.cpp	Anticipate Lane Changes	2016-06-27 10:07:43 +02:00
hilbert_values.cpp	Refactor Hilbert values computation	2016-11-28 14:17:12 +01:00
io.cpp	Rember Intersection Shapes	2016-12-01 15:24:20 +01:00
packed_vector.cpp	Apply clang-format again	2016-07-26 15:00:58 +02:00
range_table.cpp	Format with clang-format 3.8	2016-05-27 21:05:04 +02:00
rectangle.cpp	Use mmap instead of read - it's a lot faster here.	2016-06-27 17:24:30 -07:00
static_graph.cpp	Format with clang-format 3.8	2016-05-27 21:05:04 +02:00
static_rtree.cpp	Initilialize tbb task scheduler correctly. Thanks @oxidase!	2016-10-19 18:30:06 +02:00
string_util.cpp	Format with clang-format 3.8	2016-05-27 21:05:04 +02:00
viewport.cpp	Format with clang-format 3.8	2016-05-27 21:05:04 +02:00
web_mercator.cpp	Use mmap instead of read - it's a lot faster here.	2016-06-27 17:24:30 -07:00