ordering.h

// 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 <cstddef>
#include <cstdint>
#include <vector>
 
namespace dolfinx::graph
{
std::vector<std::int32_t>
reorder_gps(const graph::AdjacencyList<std::int32_t>& graph,
            std::size_t max_candidates, std::size_t num_threads);

std::vector<std::int32_t>
reorder_rcm(const graph::AdjacencyList<std::int32_t>& graph);
 
} // namespace dolfinx::graph