Note: this is documentation for an old release. View the latest documentation at docs.fenicsproject.org/dolfinx/v0.9.0/cpp/doxygen/db/dfc/ordering_8h_source.html
DOLFINx  0.5.1
DOLFINx C++ interface
ordering.h
1 // Copyright (C) 2021 Chris Richardson
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 <cstdint>
10 #include <vector>
11 
12 namespace dolfinx::graph
13 {
14 template <typename T>
15 class AdjacencyList;
16 
28 std::vector<std::int32_t>
29 reorder_gps(const graph::AdjacencyList<std::int32_t>& graph);
30 
31 } // namespace dolfinx::graph
Graph data structures and algorithms.
Definition: dofmapbuilder.h:25
std::vector< std::int32_t > reorder_gps(const graph::AdjacencyList< std::int32_t > &graph)
Re-order a graph using the Gibbs-Poole-Stockmeyer algorithm.
Definition: ordering.cpp:359