Functionality for redistributing a parallel index set using graph partitioning.
More...
|
template<class G , class T1 , class T2 > |
void | Dune::fillIndexSetHoles (const G &graph, Dune::OwnerOverlapCopyCommunication< T1, T2 > &oocomm) |
| Fills the holes in an index set. More...
|
|
template<class G , class T1 , class T2 > |
bool | Dune::buildCommunication (const G &graph, std::vector< int > &realparts, Dune::OwnerOverlapCopyCommunication< T1, T2 > &oocomm, Dune::OwnerOverlapCopyCommunication< T1, T2 > *&outcomm, RedistributeInterface &redistInf, bool verbose=false) |
|
template<class S , class T > |
void | Dune::print_carray (S &os, T *array, std::size_t l) |
|
bool | Dune::isValidGraph (std::size_t noVtx, std::size_t gnoVtx, idxtype noEdges, idxtype *xadj, idxtype *adjncy, bool checkSymmetry) |
|
template<class M , class T1 , class T2 > |
bool | Dune::commGraphRepartition (const M &mat, Dune::OwnerOverlapCopyCommunication< T1, T2 > &oocomm, int nparts, Dune::OwnerOverlapCopyCommunication< T1, T2 > *&outcomm, RedistributeInterface &redistInf, bool verbose=false) |
|
template<class G , class T1 , class T2 > |
bool | Dune::graphRepartition (const G &graph, Dune::OwnerOverlapCopyCommunication< T1, T2 > &oocomm, int nparts, Dune::OwnerOverlapCopyCommunication< T1, T2 > *&outcomm, RedistributeInterface &redistInf, bool verbose=false) |
| execute a graph repartition for a giving graph and indexset. More...
|
|
Functionality for redistributing a parallel index set using graph partitioning.
Refactored version of an intern.
- Author
- Markus Blatt