graphalgorithms.h
Go to the documentation of this file.
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
Definition: graphalgorithms.h:45
static std::vector< int > mcl(Graph< GraphGCG > &graph, int &stoppedAfter, double inflatefac, int maxiters=25, int expandfac=2)
Definition: graphalgorithms_def.h:434
Definition: graph.h:53
static std::vector< int > mst(Graph< GraphGCG > &graph, double cutoff, int minPts=4)
Definition: graphalgorithms_def.h:260
miscellaneous hypergraph methods for structure detection
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
struct gcg::subset subset
miscellaneous graph methods for structure detection
Implementation of the graph which supports both node and edge weights.
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: graphalgorithms.h:53
Definition: graph_gcg.h:48