d1/d7e/graphbuild_8h_source.html

// Copyright (C) 2010-2022 Garth N. Wells

//

// This file is part of DOLFINx (https://www.fenicsproject.org)

//

// SPDX-License-Identifier:    LGPL-3.0-or-later


#pragma once


#include <cstdint>

#include <mpi.h>

#include <span>

#include <tuple>

#include <vector>


namespace dolfinx::graph

{

template <typename T>

class AdjacencyList;

}


namespace dolfinx::mesh

{

std::tuple<graph::AdjacencyList<std::int32_t>, std::vector<std::int64_t>,

           std::size_t, std::vector<std::int32_t>>

build_local_dual_graph(std::span<const std::int64_t> cells,

                       std::span<const std::int32_t> offsets, int tdim);


graph::AdjacencyList<std::int64_t>

build_dual_graph(const MPI_Comm comm,

                 const graph::AdjacencyList<std::int64_t>& cells, int tdim);


} // namespace dolfinx::mesh

dolfinx::graph
Graph data structures and algorithms.
Definition dofmapbuilder.h:25

dolfinx::mesh
Mesh data structures and algorithms on meshes.
Definition DofMap.h:32

dolfinx::mesh::build_local_dual_graph
std::tuple< graph::AdjacencyList< std::int32_t >, std::vector< std::int64_t >, std::size_t, std::vector< std::int32_t > > build_local_dual_graph(std::span< const std::int64_t > cells, std::span< const std::int32_t > offsets, int tdim)
Compute the local part of the dual graph (cell-cell connections via facets) and facet with only one a...
Definition graphbuild.cpp:391

dolfinx::mesh::build_dual_graph
graph::AdjacencyList< std::int64_t > build_dual_graph(const MPI_Comm comm, const graph::AdjacencyList< std::int64_t > &cells, int tdim)
Build distributed mesh dual graph (cell-cell connections via facets) from minimal mesh data.
Definition graphbuild.cpp:528