// SPDX-FileCopyrightText: Copyright © DUNE Project contributors, see file LICENSE.md in module root // SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception // -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*- // vi: set et ts=4 sw=2 sts=2: // start with including some headers #include // for input/output to shell #include #include #include #include #include #include #include #include int testEdgeDepends(const Dune::Amg::EdgeProperties& flags) { int ret=0; if(!flags.depends()) { std::cerr << "Depends does not return true after setDepends! "<<__FILE__ <<":"<<__LINE__<0) std::cerr<<"Flags: "< void setupSparsityPattern(M& A) { for (typename M::CreateIterator i = A.createbegin(); i != A.createend(); ++i) { int x = i.index()%N; // x coordinate in the 2d field int y = i.index()/N; // y coordinate in the 2d field if(y>0) // insert lower neighbour i.insert(i.index()-N); if(x>0) // insert left neighbour i.insert(i.index()-1); // insert diagonal value i.insert(i.index()); if(x void setupAnisotropic(M& A, double eps) { typename M::block_type diagonal = 0, bone=0, beps=0; for(typename M::block_type::RowIterator b = diagonal.begin(); b != diagonal.end(); ++b) b->operator[](b.index())=2.0+2.0*eps; for(typename M::block_type::RowIterator b=bone.begin(); b != bone.end(); ++b) b->operator[](b.index())=-1.0; for(typename M::block_type::RowIterator b=beps.begin(); b != beps.end(); ++b) b->operator[](b.index())=-eps; for (typename M::RowIterator i = A.begin(); i != A.end(); ++i) { int x = i.index()%N; // x coordinate in the 2d field int y = i.index()/N; // y coordinate in the 2d field i->operator[](i.index())=diagonal; if(y>0) i->operator[](i.index()-N)=beps; if(yoperator[](i.index()+N)=beps; if(x>0) i->operator[](i.index()-1)=bone; if(x < N-1) i->operator[](i.index()+1)=bone; } } template void printWeightedGraph(G& graph, std::ostream& os, const N& norm=N()) { typedef typename std::remove_const::type Mutable; typedef typename std::conditional::value, typename G::VertexIterator, typename G::ConstVertexIterator>::type VertexIterator; typedef typename std::conditional::value, typename G::EdgeIterator, typename G::ConstEdgeIterator>::type EdgeIterator; for(VertexIterator vertex = graph.begin(); vertex!=graph.end(); ++vertex) { const EdgeIterator endEdge = vertex.end(); os<<"Edges starting from Vertex "<<*vertex<<" (weight="< void printPropertiesGraph(G& graph, std::ostream& os) { typedef typename std::remove_const::type Mutable; typedef typename std::conditional::value, typename G::VertexIterator, typename G::ConstVertexIterator>::type VertexIterator; typedef typename std::conditional::value, typename G::EdgeIterator, typename G::ConstEdgeIterator>::type EdgeIterator; for(VertexIterator vertex = graph.begin(); vertex!=graph.end(); ++vertex) { const EdgeIterator endEdge = vertex.end(); os<<"Edges starting from Vertex "<<*vertex<<" to vertices ("; os< void printGraph(G& graph, std::ostream& os) { typedef typename std::remove_const::type Mutable; typedef typename std::conditional::value, typename G::VertexIterator, typename G::ConstVertexIterator>::type VertexIterator; typedef typename std::conditional::value, typename G::EdgeIterator, typename G::ConstEdgeIterator>::type EdgeIterator; for(VertexIterator vertex = graph.begin(); vertex!=graph.end(); ++vertex) { const EdgeIterator endEdge = vertex.end(); os<<"Edges starting from Vertex "<<*vertex<<" to vertices "; for(EdgeIterator edge = vertex.begin(); edge != endEdge; ++edge) os< ScalarDouble; typedef Dune::BCRSMatrix BCRSMat; double diagonal=4, offdiagonal=-1; BCRSMat laplacian2d(N*N,N*N,N*N*5,BCRSMat::row_wise); setupSparsityPattern(laplacian2d); laplacian2d = offdiagonal; // Set the diagonal values for (BCRSMat::RowIterator i=laplacian2d.begin(); i!=laplacian2d.end(); ++i) i->operator[](i.index())=diagonal; //Dune::printmatrix(std::cout,laplacian2d,"2d Laplacian","row",9,1); typedef Dune::Amg::MatrixGraph MatrixGraph; MatrixGraph mg(laplacian2d); using Dune::Amg::FirstDiagonal; printWeightedGraph(mg,std::cout,FirstDiagonal()); printWeightedGraph(static_cast(mg), std::cout,FirstDiagonal()); std::vector excluded(N*N, false); for(int i=0; i < N; i++) { excluded[i]=excluded[(N-1)*N+i]=true; excluded[i*N]=excluded[i*N+N-1]=true; } typedef Dune::Amg::SubGraph,std::vector > SubGraph; SubGraph sub(mg, excluded); for(std::vector::iterator iter=excluded.begin(); iter != excluded.end(); ++iter) std::cout<<*iter<<" "; std::cout< PropertiesGraph; std::cout< saggregatesMap(pgraph.maxVertex()+1); saggregatesMap.buildAggregates(mat, spgraph, crit, false); Dune::Amg::printAggregates2d(saggregatesMap, N, N, std::cout); } int main (int argc , char ** argv) { try { testGraph(); testAggregate(); exit(testEdge()); } catch(std::exception& e) { std::cout << "ERROR: " << e.what() << std::endl; return 1; } catch (...) { std::cerr << "unknown exception caught" << std::endl; exit(1); } return 0; }