8 #include <dolfinx/graph/AdjacencyList.h>
64 Eigen::Array<double, Eigen::Dynamic, Eigen::Dynamic, Eigen::RowMajor>,
65 std::vector<std::int32_t>>
76 Eigen::Array<double, Eigen::Dynamic, Eigen::Dynamic, Eigen::RowMajor>,
77 std::vector<std::int32_t>>
This class provides a static adjacency list data structure. It is commonly used to store directed gra...
Definition: AdjacencyList.h:46
A Mesh consists of a set of connected and numbered mesh topological entities, and geometry data.
Definition: Mesh.h:57
std::tuple< graph::AdjacencyList< std::int64_t >, Eigen::Array< double, Eigen::Dynamic, Eigen::Dynamic, Eigen::RowMajor >, std::vector< std::int32_t > > compute_refinement_data(const mesh::Mesh &mesh, const mesh::MeshTags< std::int8_t > &refinement_marker)
Refine with markers returning new mesh data.
Definition: plaza.cpp:611
mesh::Mesh refine(const mesh::Mesh &mesh, bool redistribute)
Uniform refine, optionally redistributing and optionally calculating the parent-child relation for fa...
Definition: plaza.cpp:515