46 #ifndef MUELU_GRAPH_DECL_HPP
47 #define MUELU_GRAPH_DECL_HPP
67 template <class LocalOrdinal = Xpetra::CrsGraph<>::local_ordinal_type,
72 #undef MUELU_GRAPH_SHORT
109 graph_->getLocalRowView(i, rowView);
117 size_t GetNodeNumGhost()
const;
141 #define MUELU_GRAPH_SHORT
142 #endif // MUELU_GRAPH_DECL_HPP
const RCP< const Map > GetImportMap() const
Returns overlapping import map (nodes).
size_t GetNodeNumEdges() const
Return number of edges owned by the calling node.
const RCP< const Map > GetDomainMap() const
const RCP< const Teuchos::Comm< int > > GetComm() const
Xpetra::global_size_t GetGlobalNumEdges() const
Return number of global edges in the graph.
MueLu representation of a compressed row storage graph.
size_t GetNodeNumVertices() const
Return number of vertices owned by the calling node.
RCP< const CrsGraph > graph_
void print(Teuchos::FancyOStream &out, const VerbLevel verbLevel=Default) const
Print the Graph with some verbosity level to an FancyOStream object.
const ArrayRCP< const bool > GetBoundaryNodeMap() const
Returns map with local ids of boundary nodes.
GlobalOrdinal global_ordinal_type
void SetBoundaryNodeMap(const ArrayRCP< const bool > &localDirichletNodes)
Set map with local ids of boundary nodes.
size_t getNodeMaxNumRowEntries() const
Returns the maximum number of entries across all rows/columns on this node.
Graph(const RCP< const CrsGraph > &graph, const std::string &="")
MueLu representation of a graph.
bool isLocalNeighborVertex(LO i) const
Return true if vertex with local id 'v' is on current process.
std::string description() const
Return a simple one-line description of the Graph.
ArrayRCP< const bool > localDirichletNodes_
Vector of Dirichlet boundary node IDs on current process.
ArrayView< const LO > getNeighborVertices(LO i) const
Return the list of vertices adjacent to the vertex 'v'.