46 #ifndef MUELU_LEFTOVERAGGREGATIONALGORITHM_DECL_HPP
47 #define MUELU_LEFTOVERAGGREGATIONALGORITHM_DECL_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
333 #endif // MUELU_LEFTOVERAGGREGATIONALGORITHM_DECL_HPP
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.
MueLu::DefaultLocalOrdinal LocalOrdinal
Tpetra::KokkosClassic::DefaultNode::DefaultNodeType DefaultNode
void SetPhase3AggCreation(double phase3AggCreation)
double phase3AggCreation_
void SetMinNodesPerAggregate(int minNodesPerAggregate)
void AggregateLeftovers(GraphBase const &graph, Aggregates &aggregates) const
Take a partially aggregated graph and complete the aggregation.
int GetMinNodesPerAggregate() const
Helper class for providing arbitrated communication across processors.
Tpetra::Details::DefaultTypes::scalar_type DefaultScalar
MueLu::DefaultGlobalOrdinal GlobalOrdinal
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.
Base class for MueLu classes.
int minNodesPerAggregate_
LeftoverAggregationAlgorithm()
Constructor.
double GetPhase3AggCreation() const
virtual ~LeftoverAggregationAlgorithm()
Destructor.