46std::tuple<graph::AdjacencyList<std::int32_t>, std::vector<std::int64_t>,
47 std::size_t, std::vector<std::int32_t>>
49 const std::vector<std::span<const std::int64_t>>& cells);
65graph::AdjacencyList<std::int64_t>
67 const std::vector<std::span<const std::int64_t>>& cells);
Graph data structures and algorithms.
Definition dofmapbuilder.h:26
Mesh data structures and algorithms on meshes.
Definition DofMap.h:32
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 CellType > celltypes, const std::vector< std::span< const std::int64_t > > &cells)
Compute the local part of the dual graph (cell-cell connections via facets) and facets with only one ...
Definition graphbuild.cpp:354
CellType
Cell type identifier.
Definition cell_types.h:22
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)
Build distributed mesh dual graph (cell-cell connections via facets) from minimal mesh data.
Definition graphbuild.cpp:517