Note: this is documentation for an old release. View the latest documentation at docs.fenicsproject.org/dolfinx/v0.9.0/cpp/doxygen/d9/df9/topologycomputation_8h_source.html
DOLFINx  0.5.1
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 <array>
10 #include <cstdint>
11 #include <memory>
12 #include <mpi.h>
13 #include <tuple>
14 
15 namespace dolfinx::common
16 {
17 class IndexMap;
18 }
19 
20 namespace dolfinx::graph
21 {
22 template <typename T>
23 class AdjacencyList;
24 }
25 
26 namespace dolfinx::mesh
27 {
28 class Topology;
29 
39 std::tuple<std::shared_ptr<graph::AdjacencyList<std::int32_t>>,
40  std::shared_ptr<graph::AdjacencyList<std::int32_t>>,
41  std::shared_ptr<common::IndexMap>>
42 compute_entities(MPI_Comm comm, const Topology& topology, int dim);
43 
54 std::array<std::shared_ptr<graph::AdjacencyList<std::int32_t>>, 2>
55 compute_connectivity(const Topology& topology, int d0, int d1);
56 
57 } // namespace dolfinx::mesh
Miscellaneous classes, functions and types.
Graph data structures and algorithms.
Definition: dofmapbuilder.h:25
Mesh data structures and algorithms on meshes.
Definition: DofMap.h:30
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:744
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:784