|
Zoltan2
|
00001 // @HEADER 00002 // 00003 // *********************************************************************** 00004 // 00005 // Zoltan2: A package of combinatorial algorithms for scientific computing 00006 // Copyright 2012 Sandia Corporation 00007 // 00008 // Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, 00009 // the U.S. Government retains certain rights in this software. 00010 // 00011 // Redistribution and use in source and binary forms, with or without 00012 // modification, are permitted provided that the following conditions are 00013 // met: 00014 // 00015 // 1. Redistributions of source code must retain the above copyright 00016 // notice, this list of conditions and the following disclaimer. 00017 // 00018 // 2. Redistributions in binary form must reproduce the above copyright 00019 // notice, this list of conditions and the following disclaimer in the 00020 // documentation and/or other materials provided with the distribution. 00021 // 00022 // 3. Neither the name of the Corporation nor the names of the 00023 // contributors may be used to endorse or promote products derived from 00024 // this software without specific prior written permission. 00025 // 00026 // THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY 00027 // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 00028 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 00029 // PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE 00030 // CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, 00031 // EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, 00032 // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR 00033 // PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF 00034 // LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING 00035 // NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS 00036 // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 00037 // 00038 // Questions? Contact Karen Devine (kddevin@sandia.gov) 00039 // Erik Boman (egboman@sandia.gov) 00040 // Siva Rajamanickam (srajama@sandia.gov) 00041 // 00042 // *********************************************************************** 00043 // 00044 // @HEADER 00045 #ifndef _ZOLTAN2_ALGSPECTRAL_HPP_ 00046 #define _ZOLTAN2_ALGSPECTRAL_HPP_ 00047 00048 #include <Zoltan2_Algorithm.hpp> 00049 #include <Zoltan2_GraphModel.hpp> 00050 #include <Zoltan2_OrderingSolution.hpp> 00051 00052 00057 00058 00059 namespace Zoltan2{ 00060 00061 template <typename Adapter> 00062 int AlgSpectral( 00063 const RCP<GraphModel<Adapter> > &model, 00064 //const RCP<Adapter> &matrixadapter, // Hack: Use matrix adapter directly 00065 const RCP<OrderingSolution<typename Adapter::zgid_t, 00066 typename Adapter::lno_t> > &solution, 00067 const RCP<Teuchos::ParameterList> &pl, 00068 const RCP<const Teuchos::Comm<int> > &comm 00069 ) 00070 { 00071 #ifndef INCLUDE_ZOLTAN2_EXPERIMENTAL 00072 00073 Z2_THROW_EXPERIMENTAL("Zoltan2 Spectral ordering is strictly " 00074 "experimental software " 00075 "while it is being developed and tested.") 00076 00077 #else //INCLUDE_ZOLTAN2_EXPERIMENTAL 00078 00079 typedef typename Adapter::lno_t lno_t; 00080 typedef typename Adapter::gno_t gno_t; 00081 typedef typename Adapter::zgid_t zgid_t; 00082 typedef typename Adapter::scalar_t scalar_t; 00083 00084 int ierr= 0; 00085 00086 HELLO; 00087 00088 // TODO: Check params to do local or global ordering. 00089 bool localOrder = true; 00090 00091 const size_t nVtx = model->getLocalNumVertices(); 00092 lno_t *perm; 00093 perm = (lno_t *) (solution->getPermutationRCP().getRawPtr()); 00094 for (lno_t i=0; i<nVtx; i++){ 00095 perm[i] = -1; 00096 } 00097 00098 // Get local graph. 00099 ArrayView<const lno_t> edgeIds; 00100 ArrayView<const lno_t> offsets; 00101 ArrayView<StridedData<lno_t, scalar_t> > wgts; 00102 00103 model->getLocalEdgeList(edgeIds, offsets, wgts); 00104 00105 //cout << "Debug: Local graph from getLocalEdgeList" << endl; 00106 //cout << "edgeIds: " << edgeIds << endl; 00107 //cout << "offsets: " << offsets << endl; 00108 00109 // Form the graph Laplacian: L = D-A 00110 // Create a new Tpetra matrix, but use views of existing data when possible. 00111 // TODO 00112 00113 // TODO: Find smallest eigenvalues using Anasazi 00114 00115 // TODO: Sort Fiedler vector. 00116 00117 solution->setHavePerm(true); 00118 return ierr; 00119 #endif // INCLUDE_ZOLTAN2_EXPERIMENTAL 00120 } 00121 00122 } 00123 #endif
1.7.6.1