A reordering backend using the scotch library.  
 More...
#include <dumux/linear/scotchbackend.hh>
template<class IndexType>
class Dumux::ScotchBackend< IndexType >
- Note
- You need to have PTSCOTCH installed to use this feature 
|  | 
| using | Graph = std::vector<std::vector<IndexType>> | 
|  | the graph type 
 | 
|  | 
|  | 
| static std::vector< int > | computeGPSReordering (const Graph &graph, std::size_t numPasses=5) | 
|  | 
| static std::vector< int > | computeReordering (const Graph &graph, std::string scotchStrategy="") | 
|  | Compute graph re-ordering. 
 | 
|  | 
| static void | computeReordering (const Graph &graph, std::vector< int > &permutation, std::vector< int > &inversePermutation, std::string scotchStrategy="") | 
|  | Compute graph re-ordering. 
 | 
|  | 
◆ Graph
template<class IndexType> 
      
 
 
◆ computeGPSReordering()
template<class IndexType> 
  
  | 
        
          | static std::vector< int > Dumux::ScotchBackend< IndexType >::computeGPSReordering | ( | const Graph & | graph, |  
          |  |  | std::size_t | numPasses = 5 ) |  | inlinestatic | 
 
Compute reordering (map[old] -> new) using Gibbs-Poole-Stockmeyer (GPS) re-ordering 
 
 
◆ computeReordering() [1/2]
template<class IndexType> 
  
  | 
        
          | static std::vector< int > Dumux::ScotchBackend< IndexType >::computeReordering | ( | const Graph & | graph, |  
          |  |  | std::string | scotchStrategy = "" ) |  | inlinestatic | 
 
 
◆ computeReordering() [2/2]
template<class IndexType> 
  
  | 
        
          | static void Dumux::ScotchBackend< IndexType >::computeReordering | ( | const Graph & | graph, |  
          |  |  | std::vector< int > & | permutation, |  
          |  |  | std::vector< int > & | inversePermutation, |  
          |  |  | std::string | scotchStrategy = "" ) |  | inlinestatic | 
 
 
The documentation for this class was generated from the following file: