10 #include <dolfinx/common/MPI.h>
11 #include <dolfinx/graph/AdjacencyList.h>
13 #include <xtensor/xarray.hpp>
30 std::pair<graph::AdjacencyList<std::int32_t>, xt::xtensor<std::int64_t, 2>>
32 const xtl::span<const std::int32_t>& offsets,
int tdim);
43 std::pair<graph::AdjacencyList<std::int64_t>, std::int32_t>
45 const graph::AdjacencyList<std::int64_t>& cells,
int tdim);
Mesh data structures and algorithms on meshes.
Definition: DirichletBC.h:20
std::pair< graph::AdjacencyList< std::int64_t >, std::int32_t > build_dual_graph(const MPI_Comm comm, const graph::AdjacencyList< std::int64_t > &cells, int tdim)
Build distributed dual graph (cell-cell connections) from minimal mesh data.
Definition: graphbuild.cpp:546
std::pair< graph::AdjacencyList< std::int32_t >, xt::xtensor< std::int64_t, 2 > > build_local_dual_graph(const xtl::span< const std::int64_t > &cells, const xtl::span< const std::int32_t > &offsets, int tdim)
Compute the local part of the dual graph (cell-cell connections via facets)
Definition: graphbuild.cpp:304