graphbuild.h

// Copyright (C) 2010-2025 Garth N. Wells and Paul T. Kühner
//
// This file is part of DOLFINx (https://www.fenicsproject.org)
//
// SPDX-License-Identifier:    LGPL-3.0-or-later
 
#pragma once
 
#include <cstdint>
#include <dolfinx/graph/AdjacencyList.h>
#include <mpi.h>
#include <optional>
#include <span>
#include <tuple>
#include <vector>
 
namespace dolfinx::mesh
{
enum class CellType : std::int8_t;

std::tuple<graph::AdjacencyList<std::int32_t>, std::vector<std::int64_t>, int,
           std::vector<std::int32_t>>
build_local_dual_graph(std::span<const CellType> celltypes,
                       const std::vector<std::span<const std::int64_t>>& cells,
                       std::optional<std::int32_t> max_facet_to_cell_links,
                       int num_threads);

graph::AdjacencyList<std::int64_t>
build_dual_graph(MPI_Comm comm, std::span<const CellType> celltypes,
                 const std::vector<std::span<const std::int64_t>>& cells,
                 std::optional<std::int32_t> max_facet_to_cell_links,
                 int num_threads = 1);
 
} // namespace dolfinx::mesh