/usr/include/dolfin/graph/SCOTCH.h is in libdolfin-dev 1.4.0+dfsg-4.
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 69 70 71 72 73 74 75 76 77 78 79 80 | // Copyright (C) 2010 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: 2010-02-10
// Last changed:
#ifndef __SCOTCH_PARTITIONER_H
#define __SCOTCH_PARTITIONER_H
#include <cstddef>
#include <set>
#include <string>
#include <vector>
#include <dolfin/common/MPI.h>
#include "Graph.h"
namespace dolfin
{
// Forward declarations
class LocalMeshData;
/// This class proivdes an interface to SCOTCH-PT (parallel version)
class SCOTCH
{
public:
// Compute cell partition
static void compute_partition(const MPI_Comm mpi_comm,
std::vector<std::size_t>& cell_partition,
const LocalMeshData& mesh_data);
/// Compute reordering (map[old] -> new) using
/// Gibbs-Poole-Stockmeyer re-ordering
static std::vector<std::size_t> compute_gps(const Graph& graph,
std::size_t num_passes=5);
// Compute graph re-ordering
static std::vector<std::size_t>
compute_reordering(const Graph& graph,
std::string scotch_strategy="");
// Compute graph re-ordering
static
void compute_reordering(const Graph& graph,
std::vector<std::size_t>& permutation,
std::vector<std::size_t>& inverse_permutation,
std::string scotch_strategy="");
private:
// Compute cell partitions from distribted dual graph
static
void partition(const MPI_Comm mpi_comm,
const std::vector<std::set<std::size_t> >& local_graph,
const std::set<std::size_t>& ghost_vertices,
const std::vector<std::size_t>& global_cell_indices,
const std::size_t num_global_vertices,
std::vector<std::size_t>& cell_partition);
};
}
#endif
|