43 std::tuple<graph::AdjacencyList<std::int32_t>, std::vector<std::int64_t>,
44 std::size_t, std::vector<std::int32_t>>
46 const std::span<const std::int32_t>& offsets,
int tdim);
60 graph::AdjacencyList<std::int64_t>
62 const graph::AdjacencyList<std::int64_t>& cells,
int tdim);
Graph data structures and algorithms.
Definition: dofmapbuilder.h:25
Mesh data structures and algorithms on meshes.
Definition: DofMap.h:30
std::tuple< graph::AdjacencyList< std::int32_t >, std::vector< std::int64_t >, std::size_t, std::vector< std::int32_t > > build_local_dual_graph(const std::span< const std::int64_t > &cells, const 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:392
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:529