45 #ifndef _ZOLTAN2_ORDERINGALGORITHMS_HPP_ 
   46 #define _ZOLTAN2_ORDERINGALGORITHMS_HPP_ 
   56 #ifdef INCLUDE_ZOLTAN2_EXPERIMENTAL 
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)