bf2b45120a
For the MLD algorithm we can partition the NodeID range into boundary and non-boundary nodes. Since there are only we boundary nodes we can use the ArrayStorage for those yielding much faster query times. |
||
|---|---|---|
| .. | ||
| bisection_graph_view.hpp | ||
| bisection_graph.hpp | ||
| bisection_to_partition.hpp | ||
| cell_statistics.hpp | ||
| cell_storage.hpp | ||
| dinic_max_flow.hpp | ||
| edge_based_graph_reader.hpp | ||
| edge_based_graph.hpp | ||
| files.hpp | ||
| inertial_flow.hpp | ||
| multi_level_graph.hpp | ||
| multi_level_partition.hpp | ||
| partition_graph.hpp | ||
| partitioner_config.hpp | ||
| partitioner.hpp | ||
| recursive_bisection_state.hpp | ||
| recursive_bisection.hpp | ||
| remove_unconnected.hpp | ||
| renumber.hpp | ||
| reorder_first_last.hpp | ||
| serialization.hpp | ||
| tarjan_graph_wrapper.hpp | ||