/usr/include/dolfin/graph/BoostGraphOrdering.h is in libdolfin-dev 2017.2.0.post0-2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 | // Copyright (C) 2012 Garth N. Wells
//
// This file is part of DOLFIN.
//
// DOLFIN is free software: you can redistribute it and/or modify
// it under the terms of the GNU Lesser General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// DOLFIN is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public License
// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
//
// First added: 2012-07-06
// Last changed: 2012-11-12
#ifndef __DOLFIN_BOOST_GRAPH_ORDERING_H
#define __DOLFIN_BOOST_GRAPH_ORDERING_H
#include <set>
#include <utility>
#include <vector>
#include "Graph.h"
namespace dolfin
{
/// This class computes graph re-orderings. It uses Boost Graph.
class BoostGraphOrdering
{
public:
/// Compute re-ordering (map[old] -> new) using Cuthill-McKee
/// algorithm
static std::vector<int> compute_cuthill_mckee(const Graph& graph,
bool reverse=false);
/// Compute re-ordering (map[old] -> new) using Cuthill-McKee
/// algorithm
static std::vector<int>
compute_cuthill_mckee(const std::set<std::pair<std::size_t, std::size_t>>& edges,
std::size_t size, bool reverse=false);
private:
// Build Boost undirected graph
template<typename T, typename X>
static T build_undirected_graph(const X& graph);
// Build Boost directed graph
template<typename T, typename X>
static T build_directed_graph(const X& graph);
// Build Boost compressed sparse row graph
template<typename T, typename X>
static T build_csr_directed_graph(const X& graph);
};
}
#endif
|