osrm-backend/include/partition
Patrick Niklaus 57c6c6e51c Remove all boundary nodes and use simple u-v-stragtegy to pick id
This commit removes all occurences of unconnected boundary nodes
and switches to the simple heuristic of picking U for the forward
and V for the backward node. This performs better than several
fancy heuristics.
2017-03-17 11:23:48 +00:00
..
annotated_partition.hpp fixed warnings 2017-03-01 16:09:29 +00:00
bisection_graph.hpp add unit tests for the different components of the parttion tool 2017-03-01 16:09:29 +00:00
bisection_to_partition.hpp Run clang-format 2017-03-08 00:56:50 +00:00
cell_storage.hpp Remove all boundary nodes and use simple u-v-stragtegy to pick id 2017-03-17 11:23:48 +00:00
compressed_node_based_graph_reader.hpp fix edge duration truncation in partition, pending global fix 2017-03-01 16:09:29 +00:00
dinic_max_flow.hpp fix edge duration truncation in partition, pending global fix 2017-03-01 16:09:29 +00:00
edge_based_graph_reader.hpp Load edge based graph to memory in one block and then update 2017-03-17 11:19:58 +00:00
edge_based_graph.hpp Add update functionality to osrm-customize 2017-03-13 23:04:45 +00:00
graph_view.hpp add unit tests for the different components of the parttion tool 2017-03-01 16:09:29 +00:00
inertial_flow.hpp Make InertialFlow a function 2017-03-01 16:09:29 +00:00
io.hpp Add update functionality to osrm-customize 2017-03-13 23:04:45 +00:00
multi_level_partition.hpp moved basic type definitions to osrm namespace 2017-03-08 16:08:00 +00:00
partition_config.hpp parameterize cell size 2017-03-08 00:56:50 +00:00
partition_graph.hpp add unit tests for the different components of the parttion tool 2017-03-01 16:09:29 +00:00
partitioner.hpp Initial Skeleton for Recursive Bisection via Inertial Flow 2017-03-01 16:09:29 +00:00
recursive_bisection_state.hpp generate stats in annotation 2017-03-01 16:09:29 +00:00
recursive_bisection.hpp Initial interation on writing out MLD partition/cell data 2017-03-08 00:56:50 +00:00
remove_unconnected.hpp Remove all boundary nodes and use simple u-v-stragtegy to pick id 2017-03-17 11:23:48 +00:00
reorder_first_last.hpp Optimise Flow Algorithm/Datastructures in use 2017-03-01 16:09:29 +00:00
tarjan_graph_wrapper.hpp Optimise Flow Algorithm/Datastructures in use 2017-03-01 16:09:29 +00:00