MueLu  Version of the Day
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
MueLu_LWGraph_decl.hpp
Go to the documentation of this file.
1 // @HEADER
2 //
3 // ***********************************************************************
4 //
5 // MueLu: A package for multigrid based preconditioning
6 // Copyright 2012 Sandia Corporation
7 //
8 // Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation,
9 // the U.S. Government retains certain rights in this software.
10 //
11 // Redistribution and use in source and binary forms, with or without
12 // modification, are permitted provided that the following conditions are
13 // met:
14 //
15 // 1. Redistributions of source code must retain the above copyright
16 // notice, this list of conditions and the following disclaimer.
17 //
18 // 2. Redistributions in binary form must reproduce the above copyright
19 // notice, this list of conditions and the following disclaimer in the
20 // documentation and/or other materials provided with the distribution.
21 //
22 // 3. Neither the name of the Corporation nor the names of the
23 // contributors may be used to endorse or promote products derived from
24 // this software without specific prior written permission.
25 //
26 // THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY
27 // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
29 // PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE
30 // CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
31 // EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
32 // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
33 // PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
34 // LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
35 // NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
36 // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
37 //
38 // Questions? Contact
39 // Jonathan Hu (jhu@sandia.gov)
40 // Andrey Prokopenko (aprokop@sandia.gov)
41 // Ray Tuminaro (rstumin@sandia.gov)
42 //
43 // ***********************************************************************
44 //
45 // @HEADER
46 #ifndef MUELU_LWGRAPH_DECL_HPP
47 #define MUELU_LWGRAPH_DECL_HPP
48 
49 #include <Xpetra_ConfigDefs.hpp> // global_size_t
50 #include <Xpetra_CrsGraph.hpp> // inline functions requires class declaration
51 #include <Xpetra_Map_fwd.hpp>
52 
53 #include "MueLu_ConfigDefs.hpp"
54 
55 #include "MueLu_LWGraph_fwd.hpp"
56 #include "MueLu_GraphBase.hpp"
57 #include "MueLu_Exceptions.hpp"
58 
59 namespace MueLu {
60 
69  template<class LocalOrdinal = DefaultLocalOrdinal,
71  class Node = DefaultNode>
72  class LWGraph : public MueLu::GraphBase<LocalOrdinal,GlobalOrdinal,Node> {
73 #undef MUELU_LWGRAPH_SHORT
75 
76  public:
77 
79 
80 
82  //
83  // @param[in] rowPtrs: Array containing row offsets (CSR format)
84  // @param[in] colPtrs: Array containing local column indices (CSR format)
85  // @param[in] domainMap: non-overlapping (domain) map for graph. Usually provided by AmalgamationFactory stored in UnAmalgamationInfo container
86  // @param[in] importMap: overlapping map for graph. Usually provided by AmalgamationFactory stored in UnAmalgamationInfo container
87  // @param[in] objectLabel: label string
88  LWGraph(const ArrayRCP<const LO>& rowPtrs, const ArrayRCP<const LO>& colPtrs,
89  const RCP<const Map>& domainMap, const RCP<const Map>& importMap, const std::string& objectLabel = "")
90  : rows_(rowPtrs), columns_(colPtrs), domainMap_(domainMap), importMap_(importMap), domainMapRef_(*domainMap), objectLabel_(objectLabel)
91  {
92  minLocalIndex_ = domainMapRef_.getMinLocalIndex();
93  maxLocalIndex_ = domainMapRef_.getMaxLocalIndex();
94 
96 
97  LO nRows = as<LO>(rowPtrs.size()-1);
98  for (LO i = 0; i < nRows; i++)
99  maxNumRowEntries_ = std::max(maxNumRowEntries_, as<size_t>(rowPtrs[i+1] - rowPtrs[i]));
100  }
101 
102  virtual ~LWGraph() {}
104 
105  size_t GetNodeNumVertices() const { return rows_.size()-1; }
106  size_t GetNodeNumEdges() const { return rows_[rows_.size()-1]; }
107 
108  // TODO: do we really need this function
109  // It is being called from CoupledAggregation, but do we need it there?
110  Xpetra::global_size_t GetGlobalNumEdges() const {
111  Xpetra::global_size_t in = GetNodeNumEdges(), out;
112  Teuchos::reduceAll(*domainMap_->getComm(), Teuchos::REDUCE_SUM, in, Teuchos::outArg(out));
113  return out;
114  }
115 
116  const RCP<const Teuchos::Comm<int> > GetComm() const { return domainMap_->getComm(); }
117  const RCP<const Map> GetDomainMap() const { return domainMap_; }
119  const RCP<const Map> GetImportMap() const { return importMap_; }
120 
121  void SetBoundaryNodeMap(RCP<const Map> const &/* map */) { throw Exceptions::NotImplemented("LWGraph: Boundary node map not implemented."); }
122 
125 
127  bool isLocalNeighborVertex(LO i) const { return i >= minLocalIndex_ && i <= maxLocalIndex_; }
128 
131 
133  size_t getNodeMaxNumRowEntries () const { return maxNumRowEntries_; }
134 
137 
138 
140  std::string description() const { return "MueLu.description()"; } //FIXME use object's label
141 
142 
144  //using MueLu::Describable::describe; // overloading, not hiding
145  //void describe(Teuchos::FancyOStream &out, const VerbLevel verbLevel = Default) const;;
146  void print(Teuchos::FancyOStream &out, const VerbLevel verbLevel = Default) const;
147 
148  private:
149 
156  const Map& domainMapRef_;
158  const std::string & objectLabel_;
161 
162  // local index boundaries (cached from domain map)
165  };
166 
167 } // namespace MueLu
168 
169 #define MUELU_LWGRAPH_SHORT
170 #endif // MUELU_LWGRAPH_DECL_HPP
size_t getNodeMaxNumRowEntries() const
Returns the maximum number of entries across all rows/columns on this node.
MueLu::DefaultLocalOrdinal LocalOrdinal
KokkosClassic::DefaultNode::DefaultNodeType DefaultNode
const Map & domainMapRef_
const RCP< const Map > GetDomainMap() const
bool isLocalNeighborVertex(LO i) const
Return true if vertex with local id &#39;v&#39; is on current process.
Teuchos::ArrayView< const LO > getNeighborVertices(LO i) const
Return the list of vertices adjacent to the vertex &#39;v&#39;.
size_type size() const
const RCP< const Map > domainMap_
Graph maps.
MueLu::DefaultNode Node
LWGraph(const ArrayRCP< const LO > &rowPtrs, const ArrayRCP< const LO > &colPtrs, const RCP< const Map > &domainMap, const RCP< const Map > &importMap, const std::string &objectLabel="")
LWGraph constructor.
const RCP< const Teuchos::Comm< int > > GetComm() const
const ArrayRCP< const LO > rows_
Indices into columns_ array. Part of local graph information.
MueLu::DefaultGlobalOrdinal GlobalOrdinal
Exception throws when you call an unimplemented method of MueLu.
std::string description() const
Return a simple one-line description of the Graph.
const ArrayRCP< const LO > columns_
Columns corresponding to connections. Part of local graph information.
ArrayRCP< const bool > dirichletBoundaries_
Boolean array marking Dirichlet rows.
const std::string & objectLabel_
Name of this graph.
Xpetra::global_size_t GetGlobalNumEdges() const
Return number of global edges in the graph.
size_t GetNodeNumEdges() const
Return number of edges owned by the calling node.
MueLu representation of a graph.
void SetBoundaryNodeMap(const ArrayRCP< const bool > &bndry)
Set boolean array indicating which rows correspond to Dirichlet boundaries.
void SetBoundaryNodeMap(RCP< const Map > const &)
size_t GetNodeNumVertices() const
Return number of vertices owned by the calling node.
Lightweight MueLu representation of a compressed row storage 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 global ids of boundary nodes.
const RCP< const Map > GetImportMap() const
Returns overlapping import map (nodes).
const RCP< const Map > importMap_
ArrayView< T > view(size_type lowerOffset, size_type size) const