db/dfc/ordering_8h_source.html

// Copyright (C) 2021 Chris Richardson

//

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

//

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


#pragma once


#include "AdjacencyList.h"

#include <cstdint>

#include <vector>


namespace dolfinx::graph

{

std::vector<std::int32_t>

reorder_gps(const graph::AdjacencyList<std::int32_t>& graph);


} // namespace dolfinx::graph

dolfinx::graph
Graph data structures and algorithms.
Definition AdjacencyList.h:20

dolfinx::graph::reorder_gps
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:363