/usr/include/trilinos/Zoltan2_MatchingProblem.hpp is in libtrilinos-zoltan2-dev 12.10.1-3.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 | #if 0
// @HEADER
//
// ***********************************************************************
//
// Zoltan2: A package of combinatorial algorithms for scientific computing
// Copyright 2012 Sandia Corporation
//
// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation,
// the U.S. Government retains certain rights in this software.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// 1. Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
//
// 2. Redistributions in binary form must reproduce the above copyright
// notice, this list of conditions and the following disclaimer in the
// documentation and/or other materials provided with the distribution.
//
// 3. Neither the name of the Corporation nor the names of the
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY
// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE
// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
//
// Questions? Contact Karen Devine (kddevin@sandia.gov)
// Erik Boman (egboman@sandia.gov)
// Siva Rajamanickam (srajama@sandia.gov)
//
// ***********************************************************************
//
// @HEADER
/*! \file Zoltan2_MatchingProblem.hpp
\brief Defines the MatchingProblem class.
*/
#ifndef _ZOLTAN2_MATCHINGPROBLEM_HPP_
#define _ZOLTAN2_MATCHINGPROBLEM_HPP_
#include <Zoltan2_Standards.hpp>
#include <Zoltan2_Problem.hpp>
#include <Zoltan2_MatchingAlgorithms.hpp>
#include <Zoltan2_MatchingSolution.hpp>
#include <Zoltan2_GraphModel.hpp>
#include <string>
#include <bitset>
using Teuchos::rcp_dynamic_cast;
namespace Zoltan2{
////////////////////////////////////////////////////////////////////////
/*! \brief MatchingProblem sets up coloring problems for the user.
*
* The MatchingProblem is the core of the Zoltan2 coloring API.
* Based on the the user's input and parameters, the MatchingProblem
* sets up a computational Model, and a Solution object. When the user
* calls the solve() method, the MatchingProblem runs the algorithm,
* after which the Solution object may be obtained by the user.
* \todo include pointers to examples
*
* The template parameter is the InputAdapter containing the data that
* is to be partitioned.
*
* \todo - Should Problems and Solution have interfaces for returning
* views and for returning RCPs? Or just one? At a minimum,
* we should have the word "View" in function names that return views.
*
* \todo - Currently, only serial and shared-memory coloring are supported.
*/
template<typename Adapter>
class MatchingProblem : public Problem<Adapter>
{
public:
typedef typename Adapter::scalar_t scalar_t;
typedef typename Adapter::gno_t gno_t;
typedef typename Adapter::lno_t lno_t;
typedef typename Adapter::user_t user_t;
typedef typename Adapter::base_adapter_t base_adapter_t;
#ifdef HAVE_ZOLTAN2_MPI
typedef Teuchos::OpaqueWrapper<MPI_Comm> mpiWrapper_t;
#endif
/*! \brief Destructor
*/
virtual ~MatchingProblem() {};
#ifdef HAVE_ZOLTAN2_MPI
/*! \brief Constructor that takes an MPI communicator
*/
MatchingProblem(Adapter *A, ParameterList *p, MPI_Comm comm)
: Problem<Adapter>(A, p, comm)
{
HELLO;
createMatchingProblem();
};
#endif
/*! \brief Constructor that uses a default communicator
*/
MatchingProblem(Adapter *A, ParameterList *p) : Problem<Adapter>(A, p)
{
HELLO;
createMatchingProblem();
};
//! \brief Direct the problem to create a solution.
//
// \param updateInputData If true this indicates that either
// this is the first attempt at solution, or that we
// are computing a new solution and the input data has
// changed since the previous solution was computed.
// If false, this indicates that we are computing a
// new solution using the same input data was used for
// the previous solution, even though the parameters
// may have been changed.
//
// For the sake of performance, we ask the caller to set \c updateInputData
// to false if he/she is computing a new solution using the same input data,
// but different problem parameters, than that which was used to compute
// the most recent solution.
void solve(bool updateInputData=true);
//! \brief Get the solution to the problem.
//
// \return a reference to the solution to the most recent solve().
MatchingSolution<Adapter> *getSolution() {
// Get the raw ptr from the rcp
return solution_.getRawPtr();
};
private:
void createMatchingProblem();
RCP<MatchingSolution<Adapter> > solution_;
};
////////////////////////////////////////////////////////////////////////
template <typename Adapter>
void MatchingProblem<Adapter>::solve(bool newData)
{
HELLO;
size_t nVtx = this->baseModel_->getLocalNumObjects();
try
{
this->solution_ = rcp(new MatchingSolution<Adapter>(nVtx));
}
Z2_FORWARD_EXCEPTIONS;
// Determine which algorithm to use based on defaults and parameters.
// Need some exception handling here, too.
std::string method = this->params_->template get<std::string>("color_method", "SerialGreedy");
try
{
// TODO: Ignore case
if (method.compare("SerialGreedy") == 0)
{
AlgSerialGreedy<Adapter> alg(this->graphModel_, this->params_,
this->env_, this->comm_);
alg.color(this->solution_);
}
#if 0 // TODO later
else if (method.compare("speculative") == 0) // Gebremedhin-Manne
{
AlgGM<base_adapter_t> alg(this->graphModel_, this->comm_);
alg.color(this->solution_, this->params_);
}
#endif
}
Z2_FORWARD_EXCEPTIONS;
}
////////////////////////////////////////////////////////////////////////
//template <typename Adapter>
//void MatchingProblem<Adapter>::redistribute()
//{
// HELLO;
//}
////////////////////////////////////////////////////////////////////////
//! createMatchingProblem
// Method with common functionality for creating a MatchingProblem.
// Individual constructors do appropriate conversions of input, etc.
// This method does everything that all constructors must do.
template <typename Adapter>
void MatchingProblem<Adapter>::createMatchingProblem()
{
HELLO;
using Teuchos::ParameterList;
// cout << __func__zoltan2__ << " input adapter type "
// << this->inputAdapter_->inputAdapterType() << " "
// << this->inputAdapter_->inputAdapterName() << endl;
// Create a copy of the user's communicator.
// Only graph model supported.
// TODO: Allow hypergraph later?
ModelType modelType = GraphModelType;
// Select Model based on parameters and InputAdapter type
std::bitset<NUM_MODEL_FLAGS> graphFlags;
std::bitset<NUM_MODEL_FLAGS> idFlags;
switch (modelType) {
case GraphModelType:
graphFlags.set(REMOVE_SELF_EDGES);
graphFlags.set(BUILD_LOCAL_GRAPH);
this->graphModel_ = rcp(new GraphModel<base_adapter_t>(
this->baseInputAdapter_, this->envConst_, this->comm_, graphFlags));
this->baseModel_ = rcp_implicit_cast<const Model<base_adapter_t> >(
this->graphModel_);
break;
case IdentifierModelType:
case HypergraphModelType:
case CoordinateModelType:
cout << __func__zoltan2__ << " Model type " << modelType << " not yet supported."
<< endl;
break;
default:
cout << __func__zoltan2__ << " Invalid model" << modelType << endl;
break;
}
}
} //namespace Zoltan2
#endif
#endif
|