d9/df9/topologycomputation_8h_source.html

// Copyright (C) 2006-2020 Anders Logg and Garth N. Wells

//

// This file is part of DOLFINx (https://www.fenicsproject.org)

//

// SPDX-License-Identifier:    LGPL-3.0-or-later


#pragma once


#include <array>

#include <cstdint>

#include <memory>

#include <mpi.h>

#include <tuple>

#include <vector>


namespace dolfinx::common

{

class IndexMap;

}


namespace dolfinx::graph

{

template <typename T>

class AdjacencyList;

}


namespace dolfinx::mesh

{

class Topology;


std::tuple<std::shared_ptr<graph::AdjacencyList<std::int32_t>>,

           std::shared_ptr<graph::AdjacencyList<std::int32_t>>,

           std::shared_ptr<common::IndexMap>, std::vector<std::int32_t>>

compute_entities(MPI_Comm comm, const Topology& topology, int dim);


std::array<std::shared_ptr<graph::AdjacencyList<std::int32_t>>, 2>

compute_connectivity(const Topology& topology, int d0, int d1);


} // namespace dolfinx::mesh

dolfinx::common
Miscellaneous classes, functions and types.
Definition dolfinx_common.h:8

dolfinx::graph
Graph data structures and algorithms.
Definition dofmapbuilder.h:25

dolfinx::mesh
Mesh data structures and algorithms on meshes.
Definition DofMap.h:32

dolfinx::mesh::compute_entities
std::tuple< std::shared_ptr< graph::AdjacencyList< std::int32_t > >, std::shared_ptr< graph::AdjacencyList< std::int32_t > >, std::shared_ptr< common::IndexMap >, std::vector< std::int32_t > > 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:732

dolfinx::mesh::compute_connectivity
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:774