/usr/include/dolfin/graph/MatrixRenumbering.h is in libdolfin1.0-dev 1.0.0-1.
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 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 | // 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-11-15
// Last changed:
#ifndef __DOLFIN_ZOLTAN_RENUMBERING_H
#define __DOLFIN_ZOLTAN_RENUMBERING_H
#ifdef HAS_TRILINOS
#include <vector>
#include <zoltan_cpp.h>
#include "dolfin/common/Set.h"
#include "dolfin/common/types.h"
namespace dolfin
{
class SparsityPattern;
/// This class computes re-ordering based on a SparsityPattern graph
/// representation of a sparse matrix. It uses Zoltan, which is part of
/// Trilinos.
class MatrixRenumbering
{
public:
/// Constructor
MatrixRenumbering(const SparsityPattern& sparsity_pattern);
/// Compute renumbering for process (map[old] -> new)
std::vector<uint> compute_local_renumbering_map();
private:
/// Number of global graph vertices
int num_global_objects() const;
/// Number of local graph vertices
int num_local_objects() const;
/// Number of edges per vertex
void num_edges_per_vertex(std::vector<uint>& num_edges) const;
/// Vertex edges
const std::vector<std::vector<uint> > edges() const;
// Zoltan call-back functions
static int get_number_of_objects(void* data, int* ierr);
static void get_object_list(void* data, int sizeGID, int sizeLID,
ZOLTAN_ID_PTR globalID,
ZOLTAN_ID_PTR localID, int wgt_dim,
float* obj_wgts, int* ierr);
static void get_number_edges(void* data, int num_gid_entries,
int num_lid_entries,
int num_obj, ZOLTAN_ID_PTR global_ids,
ZOLTAN_ID_PTR local_ids, int* num_edges,
int* ierr);
static void get_all_edges(void* data, int num_gid_entries,
int num_lid_entries, int num_obj,
ZOLTAN_ID_PTR global_ids,
ZOLTAN_ID_PTR local_ids,
int* num_edges,
ZOLTAN_ID_PTR nbor_global_id,
int* nbor_procs, int wgt_dim,
float* ewgts, int* ierr);
// Sparsity pattern
const SparsityPattern& sparsity_pattern;
};
}
#endif
#endif
|