scotch.h

// Copyright (C) 2010-2020 Garth N. Wells and 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 "partition.h"
#include <cstdint>
#include <mpi.h>
#include <string>
#include <utility>
#include <vector>
 
namespace dolfinx::graph::scotch
{
 
enum class strategy
{
  none, // SCOTCH default strategy
  balance,
  quality,
  safety,
  speed,
  scalability
};
 
graph::partition_fn partitioner(scotch::strategy strategy = strategy::none,
                                double imbalance = 0.025, int seed = 0);
 
std::pair<std::vector<int>, std::vector<int>>
compute_gps(const AdjacencyList<std::int32_t>& graph,
            std::size_t num_passes = 5);
 
std::pair<std::vector<int>, std::vector<int>>
compute_reordering(const AdjacencyList<std::int32_t>& graph,
                   std::string scotch_strategy = "");
 
} // namespace dolfinx::graph::scotch