00001 /*@HEADER 00002 // *********************************************************************** 00003 // 00004 // Ifpack: Object-Oriented Algebraic Preconditioner Package 00005 // Copyright (2002) Sandia Corporation 00006 // 00007 // Under terms of Contract DE-AC04-94AL85000, there is a non-exclusive 00008 // license for use of this work by or on behalf of the U.S. Government. 00009 // 00010 // Redistribution and use in source and binary forms, with or without 00011 // modification, are permitted provided that the following conditions are 00012 // met: 00013 // 00014 // 1. Redistributions of source code must retain the above copyright 00015 // notice, this list of conditions and the following disclaimer. 00016 // 00017 // 2. Redistributions in binary form must reproduce the above copyright 00018 // notice, this list of conditions and the following disclaimer in the 00019 // documentation and/or other materials provided with the distribution. 00020 // 00021 // 3. Neither the name of the Corporation nor the names of the 00022 // contributors may be used to endorse or promote products derived from 00023 // this software without specific prior written permission. 00024 // 00025 // THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY 00026 // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 00027 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 00028 // PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE 00029 // CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, 00030 // EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, 00031 // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR 00032 // PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF 00033 // LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING 00034 // NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS 00035 // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 00036 // 00037 // Questions? Contact Michael A. Heroux (maherou@sandia.gov) 00038 // 00039 // *********************************************************************** 00040 //@HEADER 00041 */ 00042 00043 #include "Ifpack_ConfigDefs.h" 00044 #include "Ifpack_Partitioner.h" 00045 #include "Ifpack_OverlappingPartitioner.h" 00046 #include "Ifpack_UserPartitioner.h" 00047 #include "Epetra_CrsGraph.h" 00048 00049 //============================================================================== 00050 int Ifpack_UserPartitioner::ComputePartitions() 00051 { 00052 00053 if (Map_ == 0) 00054 IFPACK_CHK_ERR(-1); 00055 00056 // simply copy user's vector 00057 for (int i = 0 ; i < NumMyRows() ; ++i) { 00058 Partition_[i] = Map_[i]; 00059 } 00060 00061 // put together all partitions composed by 1 one vertex 00062 // (if any) 00063 std::vector<int> singletons(NumLocalParts()); 00064 for (unsigned int i = 0 ; i < singletons.size() ; ++i) { 00065 singletons[i] = 0; 00066 } 00067 00068 #if 0 00069 // may want to uncomment the following to ensure that no 00070 // partitions are in fact singletons 00071 for (int i = 0 ; i < NumMyRows() ; ++i) { 00072 ++singletons[Partition_[i]]; 00073 } 00074 00075 int count = 0; 00076 for (unsigned int i = 0 ; i < singletons.size() ; ++i) { 00077 if (singletons[i] == 1) 00078 ++count; 00079 } 00080 00081 int index = -1; 00082 for (int i = 0 ; i < NumMyRows() ; ++i) { 00083 int j = Partition_[i]; 00084 if (singletons[j] == 1) { 00085 if (index == -1) 00086 index = j; 00087 else 00088 Partition_[i] = index; 00089 } 00090 } 00091 #endif 00092 00093 return(0); 00094 }
1.7.6.1