DOLFIN-X
DOLFIN-X C++ interface
|
9 #include "AdjacencyList.h"
43 partition(
const MPI_Comm mpi_comm,
const int nparts,
45 const std::vector<std::size_t>& node_weights,
46 std::int32_t num_ghost_nodes,
bool ghosting);
54 static std::pair<std::vector<int>, std::vector<int>>
56 std::size_t num_passes = 5);
63 static std::pair<std::vector<int>, std::vector<int>>
65 std::string scotch_strategy =
"");
static std::pair< std::vector< int >, std::vector< int > > compute_reordering(const AdjacencyList< std::int32_t > &graph, std::string scotch_strategy="")
Compute graph re-ordering.
Definition: SCOTCH.cpp:38
Graph data structures and algorithms.
Definition: assemble_matrix_impl.h:23
static AdjacencyList< std::int32_t > partition(const MPI_Comm mpi_comm, const int nparts, const AdjacencyList< SCOTCH_Num > &local_graph, const std::vector< std::size_t > &node_weights, std::int32_t num_ghost_nodes, bool ghosting)
Compute distributed graph partition.
Definition: SCOTCH.cpp:123
This class provides a static adjacency list data structure. It is commonly used to store directed gra...
Definition: assemble_matrix_impl.h:26
This class provides an interface to SCOTCH-PT (parallel version)
Definition: SCOTCH.h:29
static std::pair< std::vector< int >, std::vector< int > > compute_gps(const AdjacencyList< std::int32_t > &graph, std::size_t num_passes=5)
Compute reordering (map[old] -> new) using Gibbs-Poole-Stockmeyer (GPS) re-ordering.
Definition: SCOTCH.cpp:29