A reordering backend using the scotch library.
More...
#include <dumux/parallel/scotchpartitioner.hh>
template<class IndexType = int>
class Dumux::ScotchPartitioner< 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< IndexType > | partition (const Graph &graph, std::size_t numProcessors) |
| Compute graph partition.
|
|
static void | partition (const Graph &graph, std::size_t numProcessors, std::vector< IndexType > &targetProcessors) |
| Compute graph partition.
|
|
◆ Graph
template<class IndexType = int>
◆ partition() [1/2]
template<class IndexType = int>
◆ partition() [2/2]
template<class IndexType = int>
static void Dumux::ScotchPartitioner< IndexType >::partition |
( |
const Graph & |
graph, |
|
|
std::size_t |
numProcessors, |
|
|
std::vector< IndexType > & |
targetProcessors |
|
) |
| |
|
inlinestatic |
The documentation for this class was generated from the following file: