Note: this is documentation for an old release. View the latest documentation at docs.fenicsproject.org/v0.1.0/v0.9.0/cpp
DOLFINx  0.1.0
DOLFINx C++ interface
boostordering.h
1 // Copyright (C) 2012 Garth N. Wells
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 <set>
11 #include <utility>
12 #include <vector>
13 
14 namespace dolfinx::graph
15 {
16 
17 template <typename T>
18 class AdjacencyList;
19 
21 
24 std::vector<int> compute_cuthill_mckee(const AdjacencyList<std::int32_t>& graph,
25  bool reverse = false);
26 
29 std::vector<int> compute_cuthill_mckee(
30  const std::set<std::pair<std::size_t, std::size_t>>& edges,
31  std::size_t size, bool reverse = false);
32 
33 } // namespace dolfinx::graph
dolfinx::graph
Graph data structures and algorithms.
Definition: AdjacencyList.h:18
dolfinx::graph::compute_cuthill_mckee
std::vector< int > compute_cuthill_mckee(const AdjacencyList< std::int32_t > &graph, bool reverse=false)
This class computes graph re-orderings. It uses Boost Graph.
Definition: boostordering.cpp:46