docs/zoltan2/Zoltan2__OrderingAlgorithms_8hpp_source.html

// @HEADER

// *****************************************************************************

//   Zoltan2: A package of combinatorial algorithms for scientific computing

//

// Copyright 2012 NTESS and the Zoltan2 contributors.

// SPDX-License-Identifier: BSD-3-Clause

// *****************************************************************************

// @HEADER


#ifndef _ZOLTAN2_ORDERINGALGORITHMS_HPP_

#define _ZOLTAN2_ORDERINGALGORITHMS_HPP_


#include <Zoltan2_Standards.hpp>

#include "Zoltan2_AlgNatural.hpp"

#include "Zoltan2_AlgRandom.hpp"

#include "Zoltan2_AlgRCM.hpp"

#include "Zoltan2_AlgSortedDegree.hpp"

#include "Zoltan2_AlgAMD.hpp"

#include "Zoltan2_AlgMetis.hpp"

#include <Zoltan2_AlgScotch.hpp> // BDD


#ifdef INCLUDE_ZOLTAN2_EXPERIMENTAL

#include <Zoltan2_AlgND.hpp>

#endif


#endif

Zoltan2_AlgAMD.hpp
The AMD ordering algorithm uses SuiteSparse.

Zoltan2_AlgMetis.hpp
The ND ordering algorithm uses Metis.

Zoltan2_AlgND.hpp
The algorithm for ND based ordering.

Zoltan2_AlgNatural.hpp
Natural ordering == identity permutation.

Zoltan2_AlgRCM.hpp
RCM ordering of a graph (serial, local graph only)

Zoltan2_AlgRandom.hpp
Random ordering using the Fisher-Yates (Knuth) shuffle.

Zoltan2_AlgScotch.hpp
interface to the Scotch third-party library

Zoltan2_AlgSortedDegree.hpp
Order vertices by sorted (increasing) degree.

Zoltan2_Standards.hpp
Gathering definitions used in software development.