9 #include "AdjacencyList.h"
39 partition(
const MPI_Comm mpi_comm,
const int nparts,
41 const std::vector<std::size_t>& node_weights,
42 std::int32_t num_ghost_nodes,
bool ghosting);
50 std::pair<std::vector<int>, std::vector<int>>
52 std::size_t num_passes = 5);
59 std::pair<std::vector<int>, std::vector<int>>
61 std::string scotch_strategy =
"");
This class provides a static adjacency list data structure. It is commonly used to store directed gra...
Definition: AdjacencyList.h:28
Interface to SCOTCH-PT (parallel version)
Definition: SCOTCH.h:26
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
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
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