11 #include <dolfinx/graph/AdjacencyList.h>
27 std::array<int, 3> options = {0, 0, 0});
46 double imbalance = 0.03,
47 bool suppress_output =
true);
graph::partition_fn partitioner(scotch::strategy strategy=strategy::none, double imbalance=0.025, int seed=0)
Create a graph partitioning function that uses SCOTCH.
Definition: scotch.cpp:109
Graph data structures and algorithms.
Definition: AdjacencyList.h:19
std::function< graph::AdjacencyList< std::int32_t >(MPI_Comm comm, int nparts, const AdjacencyList< std::int64_t > &local_graph, std::int32_t num_ghost_nodes, bool ghosting)> partition_fn
Signature of functions for computing the parallel partitioning of a distributed graph.
Definition: partition.h:36