Zoltan2
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros Pages
Zoltan2_OrderingAlgorithms.hpp
Go to the documentation of this file.
1 // @HEADER
2 // *****************************************************************************
3 // Zoltan2: A package of combinatorial algorithms for scientific computing
4 //
5 // Copyright 2012 NTESS and the Zoltan2 contributors.
6 // SPDX-License-Identifier: BSD-3-Clause
7 // *****************************************************************************
8 // @HEADER
9 
10 #ifndef _ZOLTAN2_ORDERINGALGORITHMS_HPP_
11 #define _ZOLTAN2_ORDERINGALGORITHMS_HPP_
12 
13 #include <Zoltan2_Standards.hpp>
14 #include "Zoltan2_AlgNatural.hpp"
15 #include "Zoltan2_AlgRandom.hpp"
16 #include "Zoltan2_AlgRCM.hpp"
18 #include "Zoltan2_AlgAMD.hpp"
19 #include "Zoltan2_AlgMetis.hpp"
20 #include <Zoltan2_AlgScotch.hpp> // BDD
21 
22 #ifdef INCLUDE_ZOLTAN2_EXPERIMENTAL
23 #include <Zoltan2_AlgND.hpp>
24 #endif
25 
26 
27 #endif
The ND ordering algorithm uses Metis.
The AMD ordering algorithm uses SuiteSparse.
Random ordering using the Fisher-Yates (Knuth) shuffle.
Order vertices by sorted (increasing) degree.
The algorithm for ND based ordering.
Natural ordering == identity permutation.
Gathering definitions used in software development.
interface to the Scotch third-party library
RCM ordering of a graph (serial, local graph only)