std::pair< graph::AdjacencyList< std::int64_t >, std::array< std::int32_t, 2 > > build_dual_graph(const MPI_Comm comm, const graph::AdjacencyList< std::int64_t > &cell_vertices, int tdim)
Build distributed dual graph (cell-cell connections) from minimal mesh data, and return (graph,...
Definition: graphbuild.cpp:476
std::pair< graph::AdjacencyList< std::int32_t >, xt::xtensor< std::int64_t, 2 > > build_local_dual_graph(const graph::AdjacencyList< std::int64_t > &cell_vertices, int tdim)
Compute local part of the dual graph, and return (local_graph, facet_cell_map, number of local edges ...
Definition: graphbuild.cpp:498