Daniel J. Hofmann dd60ae31ae Implement Parallel Spatial-Ordering/Cut Selection ... Extends explanation for recursive bisection ids Cleans up Bisection State Removes license boilerplate from partitioner config Sorts Spatially and picks Sources and Sinks Uses sets for sources and sinks for now; see how large they will get Runs n cuts in parallel changing the slope and uses the best Clarifies balance <-> ratio naming		2017-03-01 16:09:29 +00:00
..
bisection_graph.hpp	Implement Dinic Algorithm for MaximumFlow/MinimumCut	2017-03-01 16:09:29 +00:00
dinic_max_flow.hpp	Implement Parallel Spatial-Ordering/Cut Selection	2017-03-01 16:09:29 +00:00
graph_view.hpp	Implement Parallel Spatial-Ordering/Cut Selection	2017-03-01 16:09:29 +00:00
inertial_flow.hpp	Implement Parallel Spatial-Ordering/Cut Selection	2017-03-01 16:09:29 +00:00
partition_config.hpp	Implement Parallel Spatial-Ordering/Cut Selection	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	Implement Parallel Spatial-Ordering/Cut Selection	2017-03-01 16:09:29 +00:00
recursive_bisection.hpp	Initial Skeleton for Recursive Bisection via Inertial Flow	2017-03-01 16:09:29 +00:00
reorder_first_last.hpp	Implement Parallel Spatial-Ordering/Cut Selection	2017-03-01 16:09:29 +00:00