Zoltan2_MatchingSolution.hpp

Go to the documentation of this file.

#if 0
// @HEADER
// *****************************************************************************
//   Zoltan2: A package of combinatorial algorithms for scientific computing
//
// Copyright 2012 NTESS and the Zoltan2 contributors.
// SPDX-License-Identifier: BSD-3-Clause
// *****************************************************************************
// @HEADER
 
#ifndef _ZOLTAN2_MATCHINGSOLUTION_HPP_
#define _ZOLTAN2_MATCHINGSOLUTION_HPP_
 
#include <Zoltan2_Standards.hpp>
#include <Zoltan2_Solution.hpp>
 
namespace Zoltan2 {
 
template <typename Adapter>
  class MatchingSolution : public Solution
{
private: 
  typedef typename Adapter::gno_t gno_t;
  typedef typename Adapter::scalar_t scalar_t;
  typedef typename Adapter::lno_t lno_t;
 
public:
 
  MatchingSolution(
    size_t length // This should be equal to nlids. TODO: Optional?
  )
  {
    HELLO;
    length_ = length;
    colors_  = ArrayRCP<int>(length_);
  }
 
  // Accessor functions, allowing algorithms to get ptrs to solution memory.
  // Algorithms can then load the memory.
  // Non-RCP versions are provided for applications to use.
 
  inline size_t getMatchsSize() {return length_;}
 
  inline ArrayRCP<int>  &getMatchsRCP()  {return colors_;}
 
  inline int * getMatchs()  {return &(*colors_);}
 
  int getNumColors()  
  { 
    int maxColor = 0;
    for (size_t i=0; i<length_; i++){
      if (colors_[i] > maxColor)
        maxColor = colors_[i];
    }
    return maxColor;
  } 
 
  //int getGlobalNumColors(); // TODO
 
protected:
  // Matching solution consists of permutation vector(s).
  size_t length_;
  ArrayRCP<int> colors_;   // zero-based local color array
  //int numMatchs_;        // Number of colors (local on this proc)
  //int numMatchsGlobal_;  // For future distributed coloring
};
 
}
 
#endif
#endif