/*@HEADER // *********************************************************************** // // Ifpack: Object-Oriented Algebraic Preconditioner Package // Copyright (2002) Sandia Corporation // // Under terms of Contract DE-AC04-94AL85000, there is a non-exclusive // license for use of this work by or on behalf of the U.S. Government. // // This library is free software; you can redistribute it and/or modify // it under the terms of the GNU Lesser General Public License as // published by the Free Software Foundation; either version 2.1 of the // License, or (at your option) any later version. // // This library is distributed in the hope that it will be useful, but // WITHOUT ANY WARRANTY; without even the implied warranty of // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU // Lesser General Public License for more details. // // You should have received a copy of the GNU Lesser General Public // License along with this library; if not, write to the Free Software // Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 // USA // Questions? Contact Michael A. Heroux (maherou@sandia.gov) // // *********************************************************************** //@HEADER */ #ifndef IFPACK_GREEDYPARTITIONER_H #define IFPACK_GREEDYPARTITIONER_H #include "Ifpack_ConfigDefs.h" #include "Ifpack_Partitioner.h" #include "Ifpack_OverlappingPartitioner.h" #include "Teuchos_ParameterList.hpp" class Epetra_Comm; class Ifpack_Graph; class Epetra_Map; class Epetra_BlockMap; class Epetra_Import; //! Ifpack_GreedyPartitioner: A class to decompose Ifpack_Graph's using a simple greedy algorithm. class Ifpack_GreedyPartitioner : public Ifpack_OverlappingPartitioner { public: //! Constructor. Ifpack_GreedyPartitioner(const Ifpack_Graph* Graph) : Ifpack_OverlappingPartitioner(Graph), RootNode_(0) {} //! Destructor. virtual ~Ifpack_GreedyPartitioner() {}; //! Sets all the parameters for the partitioner (root node). int SetPartitionParameters(Teuchos::ParameterList& List) { RootNode_ = List.get("partitioner: root node", RootNode_); return(0); } //! Computes the partitions. Returns 0 if successful. int ComputePartitions(); private: int RootNode_; }; // class Ifpack_GreedyPartitioner #endif // IFPACK_GREEDYPARTITIONER_H