9#include "AdjacencyList.h"
39std::vector<std::int32_t>
40reorder_rcm(
const graph::AdjacencyList<std::int32_t>& graph);
53 std::span<const double> x,
int gdim)>;
59using Reorder = std::variant<reorder_graph_fn, reorder_geom_fn>;
This class provides a static adjacency list data structure.
Definition AdjacencyList.h:41
Graph data structures and algorithms.
Definition AdjacencyList.h:23
std::variant< reorder_graph_fn, reorder_geom_fn > Reorder
A graph or geometric reordering function for mesh cells.
Definition ordering.h:59
std::vector< std::int32_t > reorder_rcm(const graph::AdjacencyList< std::int32_t > &graph)
Re-order a graph using the Reverse Cuthill-McKee algorithm.
Definition ordering.cpp:149
std::function< std::vector< std::int32_t >( const graph::AdjacencyList< std::int32_t > &)> reorder_graph_fn
Signature of functions that reorder the nodes of a graph.
Definition ordering.h:43
std::function< std::vector< std::int32_t >( std::span< const double > x, int gdim)> reorder_geom_fn
Signature of functions that reorder points from their positions.
Definition ordering.h:52