Patrick Niklaus 655ca803d8 Adds a special graph for MLD with effcient boundary scan ... This graph enables efficient boundary edge scans at each level. Currenly this needs about |V|*|L| bytes of storage. We can optimize this when the highest boundary nodes ID is << |V|.		2017-03-21 16:23:10 +00:00
..
bisection_graph.cpp	Dump memory usage stats after partitioning.	2017-03-01 16:09:29 +00:00
bisection_to_partition.cpp	Run clang-format	2017-03-08 00:56:50 +00:00
cell_storage.cpp	removed code duplication in unit tests	2017-03-08 16:08:00 +00:00
dinic.cpp	add unit tests for the different components of the parttion tool	2017-03-01 16:09:29 +00:00
graph_generator.hpp	add unit tests for the different components of the parttion tool	2017-03-01 16:09:29 +00:00
graph_view.cpp	generate stats in annotation	2017-03-01 16:09:29 +00:00
multi_level_graph.cpp	Adds a special graph for MLD with effcient boundary scan	2017-03-21 16:23:10 +00:00
multi_level_partition.cpp	Moved MultiLevelPartition and CellStorage to partition namespace	2017-03-08 00:56:50 +00:00
recursive_bisection.cpp	fix tbb leaks	2017-03-01 16:09:29 +00:00
remove_unconnected.cpp	Remove all boundary nodes and use simple u-v-stragtegy to pick id	2017-03-17 11:23:48 +00:00
reorder_first_last.cpp	add unit tests for the different components of the parttion tool	2017-03-01 16:09:29 +00:00
scc_integration.cpp	add unit tests for the different components of the parttion tool	2017-03-01 16:09:29 +00:00