partition.h

// Copyright (C) 2020 Garth N. Wells
//
// This file is part of DOLFINx (https://www.fenicsproject.org)
//
// SPDX-License-Identifier:    LGPL-3.0-or-later
 
#pragma once
 
#include <algorithm>
#include <cstdint>
#include <dolfinx/graph/AdjacencyList.h>
#include <functional>
#include <mpi.h>
#include <span>
#include <utility>
#include <vector>
 
#include <iostream>
 
namespace dolfinx::graph
{
 
using partition_fn = std::function<graph::AdjacencyList<std::int32_t>(
    MPI_Comm, int, const AdjacencyList<std::int64_t>&, bool)>;
 
AdjacencyList<std::int32_t>
partition_graph(MPI_Comm comm, int nparts,
                const AdjacencyList<std::int64_t>& local_graph, bool ghosting);
 
namespace build
{
std::tuple<graph::AdjacencyList<std::int64_t>, std::vector<int>,
           std::vector<std::int64_t>, std::vector<int>>
distribute(MPI_Comm comm, const graph::AdjacencyList<std::int64_t>& list,
           const graph::AdjacencyList<std::int32_t>& destinations);
 
std::vector<std::int64_t>
compute_ghost_indices(MPI_Comm comm,
                      const std::span<const std::int64_t>& owned_indices,
                      const std::span<const std::int64_t>& ghost_indices,
                      const std::span<const int>& ghost_owners);
 
std::vector<std::int64_t>
compute_local_to_global_links(const graph::AdjacencyList<std::int64_t>& global,
                              const graph::AdjacencyList<std::int32_t>& local);
 
std::vector<std::int32_t>
compute_local_to_local(const std::span<const std::int64_t>& local0_to_global,
                       const std::span<const std::int64_t>& local1_to_global);
} // namespace build
 
} // namespace dolfinx::graph