native_cuthill_mckee.h

Go to the documentation of this file.

/*
 * Copyright (c) 2011-2015:  G-CSC, Goethe University Frankfurt
 * Author: Andreas Vogel
 * 
 * This file is part of UG4.
 * 
 * UG4 is free software: you can redistribute it and/or modify it under the
 * terms of the GNU Lesser General Public License version 3 (as published by the
 * Free Software Foundation) with the following additional attribution
 * requirements (according to LGPL/GPL v3 §7):
 * 
 * (1) The following notice must be displayed in the Appropriate Legal Notices
 * of covered and combined works: "Based on UG4 (www.ug4.org/license)".
 * 
 * (2) The following notice must be displayed at a prominent place in the
 * terminal output of covered works: "Based on UG4 (www.ug4.org/license)".
 * 
 * (3) The following bibliography is recommended for citation and must be
 * preserved in all covered files:
 * "Reiter, S., Vogel, A., Heppner, I., Rupp, M., and Wittum, G. A massively
 *   parallel geometric multigrid solver on hierarchically distributed grids.
 *   Computing and visualization in science 16, 4 (2013), 151-164"
 * "Vogel, A., Reiter, S., Rupp, M., Nägel, A., and Wittum, G. UG4 -- a novel
 *   flexible software system for simulating pde based models on high performance
 *   computers. Computing and visualization in science 16, 4 (2013), 165-179"
 * 
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
 * GNU Lesser General Public License for more details.
 */
 
 
#ifndef UG_BASE_LIB_ALGEBRA_ORDERING_STRATEGIES_ALGORITHMS_NATIVE_CUTHILL_MCKEE_H
#define UG_BASE_LIB_ALGEBRA_ORDERING_STRATEGIES_ALGORITHMS_NATIVE_CUTHILL_MCKEE_H
 
#include <vector>
 
#include "IOrderingAlgorithm.h"
#include "util.h"
 
//debug
#include "common/error.h"
#include "common/log.h"
 
namespace ug{
 
 
void ComputeCuthillMcKeeOrder(std::vector<size_t>& vNewIndex,
                              std::vector<std::vector<size_t> >& vvNeighbour,
                              bool bReverse = true,
             bool bPreserveConsec = true);
 
 
template <typename TAlgebra, typename O_t>
class NativeCuthillMcKeeOrdering : public IOrderingAlgorithm<TAlgebra, O_t>
{
public:
  typedef typename TAlgebra::matrix_type M_t;
  typedef typename TAlgebra::vector_type V_t;
  typedef IOrderingAlgorithm<TAlgebra, O_t> baseclass;
 
  NativeCuthillMcKeeOrdering() : m_bReverse(false) {}
 
  NativeCuthillMcKeeOrdering( const NativeCuthillMcKeeOrdering<TAlgebra, O_t> &parent )
      : baseclass(), m_bReverse(parent.m_bReverse){}
  NativeCuthillMcKeeOrdering( const NativeCuthillMcKeeOrdering<TAlgebra, O_t> &parent ) {…}
 
  SmartPtr<IOrderingAlgorithm<TAlgebra, O_t> > clone()
  {
    return make_sp(new NativeCuthillMcKeeOrdering<TAlgebra, O_t>(*this));
  }
  SmartPtr<IOrderingAlgorithm<TAlgebra, O_t> > clone() {…}
 
  void compute(){
    std::vector<std::vector<size_t> > neighbors;
    neighbors.resize(m->num_rows());
 
    for(size_t i=0; i<m->num_rows(); i++)
    {
      for(typename M_t::row_iterator i_it = m->begin_row(i); i_it != m->end_row(i); ++i_it){
        neighbors[i].push_back(i_it.index());
      }
    }
 
    ComputeCuthillMcKeeOrder(o, neighbors, m_bReverse, true);
 
    m = NULL;
 
    #ifdef UG_DEBUG
    check();
    #endif
  }
  void compute() {…}
 
  void check(){
    UG_COND_THROW(!is_permutation(o), name() << "::check: Not a permutation!");
  }
  void check() {…}
 
  O_t& ordering(){
    return o;
  }
  O_t& ordering() {…}
 
  void init(M_t* A, const V_t&){
    init(A);
  }
  void init(M_t* A, const V_t&) {…}
 
  void init(M_t* A){
    //TODO: replace this by UG_DLOG if permutation_util does not depend on this file anymore
    #ifdef UG_ENABLE_DEBUG_LOGS
    UG_LOG("Using " << name() << "\n");
    #endif
 
    m = A;
  }
  void init(M_t* A) {…}
 
  void init(M_t*, const V_t&, const O_t&){
    UG_THROW(name() << "::init: induced subgraph version not implemented yet!");
  }
  void init(M_t*, const V_t&, const O_t&) {…}
 
  void init(M_t*, const O_t&){
    UG_THROW(name() << "::init: induced subgraph version not implemented yet!");
  }
  void init(M_t*, const O_t&) {…}
 
  void set_reverse(bool b){
    m_bReverse = b;
  }
  void set_reverse(bool b) {…}
 
  virtual const char* name() const {
    if(m_bReverse){
      return "ReverseNativeCuthillMcKeeOrdering (ug4 version)";
    }
    else{
      return "NativeCuthillMcKeeOrdering (ug4 version)";
    }
  }
  virtual const char* name() const  {…}
private:
  O_t o;
  M_t* m;
 
  bool m_bReverse;
};
class NativeCuthillMcKeeOrdering : public IOrderingAlgorithm<TAlgebra, O_t> {…};
 
 
}
 
#endif