dune-istl
2.6-git
|
Functionality for redistributing a parallel index set using graph partitioning. More...
#include <cassert>
#include <map>
#include <utility>
#include <dune/common/timer.hh>
#include <dune/common/unused.hh>
#include <dune/common/enumset.hh>
#include <dune/common/stdstreams.hh>
#include <dune/common/parallel/mpitraits.hh>
#include <dune/common/parallel/communicator.hh>
#include <dune/common/parallel/indexset.hh>
#include <dune/common/parallel/indicessyncer.hh>
#include <dune/common/parallel/remoteindices.hh>
#include <dune/common/rangeutilities.hh>
#include <dune/istl/owneroverlapcopy.hh>
#include <dune/istl/paamg/graph.hh>
Go to the source code of this file.
Namespaces | |
Dune | |
Dune::Metis | |
Typedefs | |
using | Dune::Metis::real_t = float |
using | Dune::Metis::idx_t = std::size_t |
Functions | |
template<class G , class P , class T1 , class T2 , class R > | |
bool | Dune::graphRepartition (const G &graph, P &oocomm, int nparts, P *&outcomm, R &redistInf, bool v=false) |
template<class G , class P , class T1 , class T2 , class R > | |
bool | Dune::commGraphRepartition (const G &graph, P &oocomm, int nparts, P *&outcomm, R &redistInf, bool v=false) |
Functionality for redistributing a parallel index set using graph partitioning.
Refactored version of an intern.