45#ifndef _ZOLTAN2_ORDERINGALGORITHMS_HPP_
46#define _ZOLTAN2_ORDERINGALGORITHMS_HPP_
57#ifdef INCLUDE_ZOLTAN2_EXPERIMENTAL
The AMD ordering algorithm uses SuiteSparse.
The ND ordering algorithm uses Metis.
The algorithm for ND based ordering.
Natural ordering == identity permutation.
RCM ordering of a graph (serial, local graph only)
Random ordering using the Fisher-Yates (Knuth) shuffle.
interface to the Scotch third-party library
Order vertices by sorted (increasing) degree.
Gathering definitions used in software development.