21"This type of partitioner works basically only for testing. Orthogonal meshes"
22" can produce decent partitioning but for unstructured grids it can be pretty"
23" bad. It partitions cells based on their linear index \"global_id\" instead "
24"of actually working with the graph.");
30 "If non-zero will restrict all cells to this rank, "
31 "essentially transforming this partitioner into a "
32 "single-rank partitioner.");
39 all_to_rank_(params.GetParamValue<int>(
"all_to_rank"))
45 const std::vector<std::vector<uint64_t>>& graph,
46 const std::vector<chi_mesh::Vector3>&,
47 const int number_of_parts)
51 const std::vector<chi::SubSetInfo> sub_sets =
54 std::vector<int64_t> pids(graph.size(), 0);
59 for (
int k = 0; k < number_of_parts; ++k)
60 for (
size_t m = 0; m < sub_sets[k].ss_size; ++m)
static InputParameters GetInputParameters()
LinearGraphPartitioner(const InputParameters ¶ms)
std::vector< int64_t > Partition(const std::vector< std::vector< uint64_t > > &graph, const std::vector< chi_mesh::Vector3 > ¢roids, int number_of_parts) override
static InputParameters GetInputParameters()
std::vector< SubSetInfo > MakeSubSets(size_t num_items, size_t desired_num_subsets)
RegisterChiObject(chi, KBAGraphPartitioner)