Line data    Source code

       1              : /*
       2              :  * Copyright (c) 2011-2015:  G-CSC, Goethe University Frankfurt
       3              :  * Author: Andreas Vogel
       4              :  * 
       5              :  * This file is part of UG4.
       6              :  * 
       7              :  * UG4 is free software: you can redistribute it and/or modify it under the
       8              :  * terms of the GNU Lesser General Public License version 3 (as published by the
       9              :  * Free Software Foundation) with the following additional attribution
      10              :  * requirements (according to LGPL/GPL v3 §7):
      11              :  * 
      12              :  * (1) The following notice must be displayed in the Appropriate Legal Notices
      13              :  * of covered and combined works: "Based on UG4 (www.ug4.org/license)".
      14              :  * 
      15              :  * (2) The following notice must be displayed at a prominent place in the
      16              :  * terminal output of covered works: "Based on UG4 (www.ug4.org/license)".
      17              :  * 
      18              :  * (3) The following bibliography is recommended for citation and must be
      19              :  * preserved in all covered files:
      20              :  * "Reiter, S., Vogel, A., Heppner, I., Rupp, M., and Wittum, G. A massively
      21              :  *   parallel geometric multigrid solver on hierarchically distributed grids.
      22              :  *   Computing and visualization in science 16, 4 (2013), 151-164"
      23              :  * "Vogel, A., Reiter, S., Rupp, M., Nägel, A., and Wittum, G. UG4 -- a novel
      24              :  *   flexible software system for simulating pde based models on high performance
      25              :  *   computers. Computing and visualization in science 16, 4 (2013), 165-179"
      26              :  * 
      27              :  * This program is distributed in the hope that it will be useful,
      28              :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
      29              :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
      30              :  * GNU Lesser General Public License for more details.
      31              :  */
      32              : 
      33              : #include "common/common.h"
      34              : #include "lib_algebra/ordering_strategies/algorithms/native_cuthill_mckee.h" //ComputeCuthillMcKeeOrder
      35              : #include "cuthill_mckee.h"
      36              : #include <algorithm>
      37              : #include <vector>
      38              : #include <queue>
      39              : #include "common/profiler/profiler.h"
      40              : #include "lib_disc/domain.h"
      41              : 
      42              : namespace ug{
      43              : 
      44            0 : void OrderCuthillMcKee(DoFDistribution& dofDistr, bool bReverse)
      45              : {
      46              :         PROFILE_FUNC();
      47              : //      get adjacency graph
      48              :         std::vector<std::vector<size_t> > vvConnection;
      49              :         try{
      50            0 :                 dofDistr.get_connections(vvConnection);
      51              :         }
      52            0 :         UG_CATCH_THROW("OrderCuthillMcKee: No adjacency graph available.");
      53              : 
      54              : //      get mapping for cuthill-mckee order
      55              :         std::vector<size_t> vNewIndex;
      56            0 :         ComputeCuthillMcKeeOrder(vNewIndex, vvConnection, bReverse);
      57              : 
      58              : //      reorder indices
      59            0 :         dofDistr.permute_indices(vNewIndex);
      60            0 : }
      61              : 
      62              : template <typename TDomain>
      63            0 : void OrderCuthillMcKee(ApproximationSpace<TDomain>& approxSpace, bool bReverse)
      64              : {
      65              :         UG_LOG ("OrderCuthillMcKee: This function is obsolete and may cause problems. Avoid it! Alternatives: Ordering strategies in solvers etc.\n");
      66              :         
      67            0 :         std::vector<SmartPtr<DoFDistribution> > vDD = approxSpace.dof_distributions();
      68              : 
      69            0 :         for(size_t i = 0; i < vDD.size(); ++i)
      70            0 :                 OrderCuthillMcKee(*vDD[i], bReverse);
      71            0 : }
      72              : 
      73              : #ifdef UG_DIM_1
      74              : template void OrderCuthillMcKee<Domain1d>(ApproximationSpace<Domain1d>& approxSpace, bool bReverse);
      75              : #endif
      76              : #ifdef UG_DIM_2
      77              : template void OrderCuthillMcKee<Domain2d>(ApproximationSpace<Domain2d>& approxSpace, bool bReverse);
      78              : #endif
      79              : #ifdef UG_DIM_3
      80              : template void OrderCuthillMcKee<Domain3d>(ApproximationSpace<Domain3d>& approxSpace, bool bReverse);
      81              : #endif
      82              : 
      83              : }