Patrick Niklaus 0266c9d969 Renumber nodes after running osrm-partition ... The new numbering uses the partition information to sort border nodes first to compactify storages that need access indexed by border node ID. We also get an optimized cache performance for free sincr we can also recursively sort the nodes by cell ID. This implements issue #3779.		2017-06-02 18:12:13 +00:00
..
annotated_partition.cpp	fixed warnings	2017-03-01 16:09:29 +00:00
bisection_to_partition.cpp	Remove all boundary nodes and use simple u-v-stragtegy to pick id	2017-03-17 11:23:48 +00:00
dinic_max_flow.cpp	add unit tests for the different components of the parttion tool	2017-03-01 16:09:29 +00:00
graph_view.cpp	add unit tests for the different components of the parttion tool	2017-03-01 16:09:29 +00:00
inertial_flow.cpp	Make InertialFlow a function	2017-03-01 16:09:29 +00:00
partitioner.cpp	Renumber nodes after running osrm-partition	2017-06-02 18:12:13 +00:00
recursive_bisection_state.cpp	generate stats in annotation	2017-03-01 16:09:29 +00:00
recursive_bisection.cpp	Initial interation on writing out MLD partition/cell data	2017-03-08 00:56:50 +00:00
renumber.cpp	Renumber nodes after running osrm-partition	2017-06-02 18:12:13 +00:00
tarjan_graph_wrapper.cpp	always emit a small component view	2017-03-01 16:09:29 +00:00