53 #ifndef MUELU_ISOLATEDNODEAGGREGATIONALGORITHM_DEF_HPP_
54 #define MUELU_ISOLATEDNODEAGGREGATIONALGORITHM_DEF_HPP_
56 #include <Teuchos_Comm.hpp>
57 #include <Teuchos_CommHelpers.hpp>
63 #include "MueLu_LWGraph.hpp"
64 #include "MueLu_Aggregates.hpp"
70 template <
class LocalOrdinal,
class GlobalOrdinal,
class Node>
72 Monitor m(*
this,
"BuildAggregates");
77 for (
LO i = 0; i < numRows; i++)
80 numNonAggregatedNodes--;
Container class for aggregation information.
KOKKOS_INLINE_FUNCTION size_type GetNodeNumVertices() const
Return number of graph vertices.
void BuildAggregates(const ParameterList ¶ms, const LWGraph &graph, Aggregates &aggregates, std::vector< unsigned > &aggStat, LO &numNonAggregatedNodes) const
Local aggregation.
KOKKOS_INLINE_FUNCTION neighbor_vertices_type getNeighborVertices(LO i) const
Return the list of vertices adjacent to the vertex 'v'.
Timer to be used in non-factories.
Lightweight MueLu representation of a compressed row storage graph.