bridge.h
Go to the documentation of this file.
33 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
50 /** add n nodes in the graph at the same time. it is much faster than to call addNode() many times */
53 /** add n nodes in the graph at the same time. it is much faster than to call addNode() many times. weights represent node weights */
89 virtual std::vector<std::pair<int, double> > getNeighborWeights(int i) {return std::vector<std::pair<int, double> >();};
virtual int graphGetWeights(int i)=0
virtual int getNNeighbors(int i)=0
virtual SCIP_RETCODE flush()=0
virtual SCIP_RETCODE deleteEdge(int i, int j)=0
Definition: class_conspartition.cpp:43
virtual int getNNodes()=0
virtual SCIP_RETCODE addNode()=0
virtual double getEdgeWeightPercentile(double q)=0
virtual SCIP_RETCODE addNNodes(int _n_nodes)=0
virtual SCIP_RETCODE getEdges(std::vector< void * > &edges)=0
Definition: bridge.h:44
virtual SCIP_RETCODE setEdge(int i, int j, double weight)=0
virtual std::vector< std::pair< int, double > > getNeighborWeights(int i)
Definition: bridge.h:89
virtual SCIP_RETCODE addEdge(int i, int j, double weight)=0
virtual std::vector< int > getNeighbors(int i)=0
virtual SCIP_RETCODE deleteNode(int i)=0
virtual double getEdgeWeight(int i, int j)=0
virtual SCIP_Bool isEdge(int i, int j)=0
virtual int getNEdges()=0
virtual SCIP_RETCODE normalize()=0