/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* This file is part of the program */ /* GCG --- Generic Column Generation */ /* a Dantzig-Wolfe decomposition based extension */ /* of the branch-cut-and-price framework */ /* SCIP --- Solving Constraint Integer Programs */ /* */ /* Copyright (C) 2010-2022 Operations Research, RWTH Aachen University */ /* Zuse Institute Berlin (ZIB) */ /* */ /* This program 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 3 */ /* of the License, or (at your option) any later version. */ /* */ /* This program 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 program; if not, write to the Free Software */ /* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA.*/ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /**@file graph_tclique.h * @brief interface to the SCIP tclique graph library * @author Annika Thome * @author Martin Bergner */ /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/ #ifndef GCG_GRAPH_TCLIQUE_H_ #define GCG_GRAPH_TCLIQUE_H_ #include "bridge.h" #include "tclique/tclique.h" namespace gcg { class GraphTclique: public gcg::Bridge { private: TCLIQUE_GRAPH* graph; public: GraphTclique(); virtual ~GraphTclique(); virtual SCIP_RETCODE addNNodes(int _n_nodes); virtual SCIP_RETCODE addNNodes(int _n_nodes, std::vector weights); virtual int getNNodes(); virtual int getNEdges(); virtual SCIP_RETCODE getEdges(std::vector& edges); virtual SCIP_Bool isEdge(int i, int j); virtual int getNNeighbors(int i); virtual std::vector getNeighbors(int i); virtual SCIP_RETCODE addNode(int i, int weight); virtual SCIP_RETCODE addNode(); virtual SCIP_RETCODE deleteNode(int i); virtual SCIP_RETCODE addEdge(int i, int j); virtual SCIP_RETCODE addEdge(int i, int j, double weight); virtual SCIP_RETCODE setEdge(int i, int j, double weight); virtual double getEdgeWeight(int i, int j); virtual std::vector > getNeighborWeights(int i); virtual SCIP_RETCODE deleteEdge(int i, int j); virtual int graphGetWeights(int i); virtual SCIP_RETCODE flush(); virtual SCIP_RETCODE normalize(); virtual double getEdgeWeightPercentile(double q); #ifdef WITH_GSL void expand(int factor) {return;} void inflate(double factor) {return;} void colL1Norm() {return;} void prune() {return;} bool stopMCL(int iter) {return true;} std::vector getClustersMCL() {return std::vector();} virtual void initMCL() {return;} virtual void clearMCL() {return;} #endif }; } /* namespace gcg */ #endif /* GCG_GRAPH_TCLIQUE_H_ */