Note: this is documentation for an old release. View the latest documentation at docs.fenicsproject.org/v0.3.0/v0.9.0/cpp
DOLFINx  0.3.0
DOLFINx C++ interface
topologycomputation.h
1 // Copyright (C) 2006-2020 Anders Logg and 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 "cell_types.h"
10 #include <array>
11 #include <cstdint>
12 #include <dolfinx/common/MPI.h>
13 #include <memory>
14 #include <tuple>
15 
16 namespace dolfinx::common
17 {
18 class IndexMap;
19 }
20 
21 namespace dolfinx::graph
22 {
23 template <typename T>
24 class AdjacencyList;
25 }
26 
27 namespace dolfinx::mesh
28 {
29 class Topology;
30 
40 std::tuple<std::shared_ptr<graph::AdjacencyList<std::int32_t>>,
41  std::shared_ptr<graph::AdjacencyList<std::int32_t>>,
42  std::shared_ptr<common::IndexMap>>
43 compute_entities(MPI_Comm comm, const Topology& topology, int dim);
44 
55 std::array<std::shared_ptr<graph::AdjacencyList<std::int32_t>>, 2>
56 compute_connectivity(const Topology& topology, int d0, int d1);
57 
58 } // namespace dolfinx::mesh
Miscellaneous classes, functions and types.
Graph data structures and algorithms.
Definition: AdjacencyList.h:19
Mesh data structures and algorithms on meshes.
Definition: DirichletBC.h:20
std::array< std::shared_ptr< graph::AdjacencyList< std::int32_t > >, 2 > compute_connectivity(const Topology &topology, int d0, int d1)
Compute connectivity (d0 -> d1) for given pair of topological dimensions.
Definition: topologycomputation.cpp:646
std::tuple< std::shared_ptr< graph::AdjacencyList< std::int32_t > >, std::shared_ptr< graph::AdjacencyList< std::int32_t > >, std::shared_ptr< common::IndexMap > > compute_entities(MPI_Comm comm, const Topology &topology, int dim)
Compute mesh entities of given topological dimension by computing entity-to-vertex connectivity (dim,...
Definition: topologycomputation.cpp:605