46 #ifndef MUELU_AGGREGATIONPHASE2AALGORITHM_DECL_HPP_
47 #define MUELU_AGGREGATIONPHASE2AALGORITHM_DECL_HPP_
86 #undef MUELU_AGGREGATIONPHASE2AALGORITHM_SHORT
110 std::string
description()
const {
return "Phase 2a (secondary)"; }
115 #define MUELU_AGGREGATIONPHASE2AALGORITHM_SHORT
MueLu::DefaultLocalOrdinal LocalOrdinal
KokkosClassic::DefaultNode::DefaultNodeType DefaultNode
Container class for aggregation information.
Pure virtual base class for all MueLu aggregation algorithms.
virtual ~AggregationPhase2aAlgorithm()
Destructor.
MueLu::DefaultGlobalOrdinal GlobalOrdinal
void BuildAggregates(const ParameterList ¶ms, const GraphBase &graph, Aggregates &aggregates, std::vector< unsigned > &aggStat, LO &numNonAggregatedNodes) const
Local aggregation.
AggregationPhase2aAlgorithm(const RCP< const FactoryBase > &=Teuchos::null)
Constructor.
std::string description() const
Return a simple one-line description of this object.
MueLu representation of a graph.
Among unaggregated points, see if we can make a reasonable size aggregate out of it.IdeaAmong unaggregated points, see if we can make a reasonable size aggregate out of it. We do this by looking at neighbors and seeing how many are unaggregated and on my processor. Loosely, base the number of new aggregates created on the percentage of unaggregated nodes.