46#ifndef MUELU_LEFTOVERAGGREGATIONALGORITHM_DECL_HPP
47#define MUELU_LEFTOVERAGGREGATIONALGORITHM_DECL_HPP
49#include <Xpetra_Vector_fwd.hpp>
50#include <Xpetra_VectorFactory_fwd.hpp>
69#undef MUELU_LEFTOVERAGGREGATIONALGORITHM_SHORT
103#define MUELU_NOSCORE -100
108#define MUELU_DISTONE_VERTEX_WEIGHT 100
112#define INCR_SCALING 3
123#define MUELU_PENALTYFACTOR .30
332#define MUELU_LEFTOVERAGGREGATIONALGORITHM_SHORT
MueLu::DefaultLocalOrdinal LocalOrdinal
MueLu::DefaultGlobalOrdinal GlobalOrdinal
Base class for MueLu classes.
Helper class for providing arbitrated communication across processors.
virtual ~LeftoverAggregationAlgorithm()
Destructor.
void RootCandidates(my_size_t nVertices, ArrayView< const LO > &vertex2AggId, GraphBase const &graph, ArrayRCP< LO > &candidates, my_size_t &nCandidates, global_size_t &nCandidatesGlobal) const
Build a list of candidate root nodes.
void SetPhase3AggCreation(double phase3AggCreation)
double phase3AggCreation_
double GetPhase3AggCreation() const
int RemoveSmallAggs(Aggregates &aggregates, int min_size, RCP< Xpetra::Vector< SC, LO, GO, NO > > &distWeights, const MueLu::CoupledAggregationCommHelper< LO, GO, NO > &myWidget) const
Attempt to clean up aggregates that are too small.
LeftoverAggregationAlgorithm()
Constructor.
int GetMinNodesPerAggregate() const
void AggregateLeftovers(GraphBase const &graph, Aggregates &aggregates) const
Take a partially aggregated graph and complete the aggregation.
int minNodesPerAggregate_
void SetMinNodesPerAggregate(int minNodesPerAggregate)
Namespace for MueLu classes and methods.
KokkosClassic::DefaultNode::DefaultNodeType DefaultNode
Tpetra::Details::DefaultTypes::scalar_type DefaultScalar