A reordering backend using the scotch library. More...
#include <dumux/linear/scotchbackend.hh>
A reordering backend using the scotch library.
Public Types | |
| using | Graph = std::vector<std::vector<IndexType>> |
| the graph type | |
Static Public Member Functions | |
| 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. | |
| using Dumux::ScotchBackend< IndexType >::Graph = std::vector<std::vector<IndexType>> |
the graph type
|
inlinestatic |
Compute reordering (map[old] -> new) using Gibbs-Poole-Stockmeyer (GPS) re-ordering
|
inlinestatic |
Compute graph re-ordering.
|
inlinestatic |
Compute graph re-ordering.