1 // Copyright (C) 2007-2020 CEA/DEN, EDF R&D
3 // This library is free software; you can redistribute it and/or
4 // modify it under the terms of the GNU Lesser General Public
5 // License as published by the Free Software Foundation; either
6 // version 2.1 of the License, or (at your option) any later version.
8 // This library is distributed in the hope that it will be useful,
9 // but WITHOUT ANY WARRANTY; without even the implied warranty of
10 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
11 // Lesser General Public License for more details.
13 // You should have received a copy of the GNU Lesser General Public
14 // License along with this library; if not, write to the Free Software
15 // Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
17 // See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
20 #include "RENUMBER_BOOSTRenumbering.hxx"
22 #include "MEDCouplingMemArray.hxx"
25 #include <boost/config.hpp>
26 #include <boost/graph/adjacency_list.hpp>
27 #include <boost/graph/cuthill_mckee_ordering.hpp>
28 #include <boost/graph/properties.hpp>
29 #include <boost/graph/bandwidth.hpp>
31 void BOOSTRenumbering::renumber(const mcIdType *graph, const mcIdType *index_graph, mcIdType nbCell, MEDCoupling::DataArrayIdType *&iperm, MEDCoupling::DataArrayIdType *&perm)
33 MEDCoupling::MCAuto<MEDCoupling::DataArrayIdType> out0(MEDCoupling::DataArrayIdType::New()),out1(MEDCoupling::DataArrayIdType::New());
34 out0->alloc(nbCell,1); out1->alloc(nbCell,1);
35 out0->fillWithZero(); out1->fillWithZero();
37 typedef boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS,
38 boost::property<boost::vertex_color_t, boost::default_color_type,
39 boost::property<boost::vertex_degree_t,mcIdType> > > Graph;
41 for (mcIdType i=0;i<nbCell;++i)
42 for (mcIdType j=index_graph[i];j<index_graph[i+1];++j)
43 add_edge(i,graph[j],G);
44 boost::property_map<Graph, boost::vertex_index_t>::type
45 index_map = boost::get(boost::vertex_index, G);
46 boost::cuthill_mckee_ordering(G, out0->getPointer(), boost::get(boost::vertex_color, G),
47 boost::make_degree_map(G));
48 mcIdType *out0Ptr(out0->getPointer()),*out1Ptr(out1->getPointer());
49 for(mcIdType c=0;c!=nbCell;++c)
50 out1Ptr[index_map[out0Ptr[nbCell-c-1]]]=c;
52 iperm=out0.retn(); perm=out1.retn();