Note: this is documentation for an old release. View the latest documentation at docs.fenicsproject.org/dolfinx/v0.9.0/cpp/doxygen/d1/d7e/graphbuild_8h_source.html
DOLFINx  0.5.1
DOLFINx C++ interface
graphbuild.h
1 // Copyright (C) 2010-2022 Garth N. Wells
2 //
3 // This file is part of DOLFINx (https://www.fenicsproject.org)
4 //
5 // SPDX-License-Identifier: LGPL-3.0-or-later
6 
7 #pragma once
8 
9 #include <cstdint>
10 #include <mpi.h>
11 #include <span>
12 #include <tuple>
13 #include <vector>
14 
15 namespace dolfinx::graph
16 {
17 template <typename T>
18 class AdjacencyList;
19 }
20 
21 namespace dolfinx::mesh
22 {
43 std::tuple<graph::AdjacencyList<std::int32_t>, std::vector<std::int64_t>,
44  std::size_t, std::vector<std::int32_t>>
45 build_local_dual_graph(const std::span<const std::int64_t>& cells,
46  const std::span<const std::int32_t>& offsets, int tdim);
47 
60 graph::AdjacencyList<std::int64_t>
61 build_dual_graph(const MPI_Comm comm,
62  const graph::AdjacencyList<std::int64_t>& cells, int tdim);
63 
64 } // namespace dolfinx::mesh
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