graphalgorithms_def.h
Go to the documentation of this file.
33 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
138 int minPts /**< minimum number of neighbors needed to define a core point (can be fixed to 4 as stated in the paper) */
158 std::vector<std::pair<int, double> > NeighborPts_row = graph.getNeighborWeights(i); // gets ALL connected points
178 // Add border points also. We assign the border point the same label as the first core point. This is basically arbitrary, but not random.
185 std::vector<std::pair<int, double> > NeighborPts_row = graph.getNeighborWeights(i); // gets ALL connected points // holds ONLY the neighbors within the radius
227 std::vector<std::pair<int, double> > NeighborPts_tmp_row = graph.getNeighborWeights(neighbor); // gets ALL connected points
static std::vector< int > dbscan(Graph< GraphGCG > &graph, double eps, int minPts=4)
Definition: graphalgorithms_def.h:135
static void expandCluster(Graph< T > &graph, std::vector< bool > &visited, std::vector< bool > &is_core, std::vector< int > &labels, int point, std::vector< int > &NeighborPts, int curr_cluster, double eps, int minPts)
Definition: graphalgorithms_def.h:201
Definition: class_conspartition.cpp:43
static SCIP_Real computeMincut(Hypergraph< T > &graph)
Definition: graphalgorithms_def.h:83
static void mstunion(std::vector< subset > &subsets, int x, int y)
Definition: graphalgorithms_def.h:411
static std::vector< int > mcl(Graph< GraphGCG > &graph, int &stoppedAfter, double inflatefac, int maxiters=25, int expandfac=2)
Definition: graphalgorithms_def.h:434
static SCIP_RETCODE partition(SCIP *scip, SCIP_VAR **J, int *Jsize, SCIP_Longint *priority, SCIP_VAR **F, int Fsize, SCIP_VAR **origvar, SCIP_Real *median)
Definition: branch_generic.c:832
std::vector< std::pair< int, double > > getNeighborWeights(int i)
Definition: graph_def.h:270
Definition: graph.h:53
virtual std::vector< int > getPartition() const
Definition: graph_interface.h:60
interface to the SCIP tclique graph library
static std::vector< int > mst(Graph< GraphGCG > &graph, double cutoff, int minPts=4)
Definition: graphalgorithms_def.h:260
std::vector< int > getHyperedgeNodes(int i)
Definition: hypergraph_def.h:157
static int mstfind(std::vector< subset > &subsets, int i)
Definition: graphalgorithms_def.h:398
static SCIP_Real computeSoed(Hypergraph< T > &graph)
Definition: graphalgorithms_def.h:59
Implementation of the graph which supports both node and edge weights.
several metrics for graphs
Definition: hypergraph.h:54
static int weightComp(const void *a, const void *b)
Definition: graphalgorithms_def.h:387
static SCIP_Real computekMetric(Hypergraph< T > &graph)
Definition: graphalgorithms_def.h:109
Definition: graph_gcg.h:48