9#include "AdjacencyList.h"
46 MPI_Comm comm,
int nparts, std::span<const double> x,
int gdim,
47 std::optional<std::span<const std::int32_t>> weights = std::nullopt);
72 MPI_Comm comm,
int nparts, std::span<const double> x,
int gdim,
73 std::optional<std::span<const std::int32_t>> weights = std::nullopt);
Graph data structures and algorithms.
Definition AdjacencyList.h:23
std::vector< int > partition_sfc_hilbert(MPI_Comm comm, int nparts, std::span< const double > x, int gdim, std::optional< std::span< const std::int32_t > > weights=std::nullopt)
Partition points into nparts groups using a Hilbert space-filling curve.
Definition sfc.cpp:689
std::vector< int > partition_sfc_morton(MPI_Comm comm, int nparts, std::span< const double > x, int gdim, std::optional< std::span< const std::int32_t > > weights=std::nullopt)
Partition points into nparts groups using a Morton ('Z-order') space-filling curve.
Definition sfc.cpp:681
std::vector< std::int32_t > reorder_sfc_hilbert(std::span< const double > x, int gdim)
Reorder locally supplied points using a Hilbert space-filling curve.
Definition sfc.cpp:704
std::vector< std::int32_t > reorder_sfc_morton(std::span< const double > x, int gdim)
Reorder locally supplied points using a Morton ('Z-order') space-filling curve.
Definition sfc.cpp:697