SCIP_DisjointSet Struct Reference

Detailed Description

disjoint set (disjoint set (union find)) data structure for querying and updating connectedness in a graph with integer vertices 0,...,n - 1

Definition at line 277 of file struct_misc.h.

#include <struct_misc.h>

Data Fields
int *	parents
int *	sizes
int	size
int	componentcount

Field Documentation

parents

int* SCIP_DisjointSet::parents

array to store the parent node index for every vertex

Definition at line 279 of file struct_misc.h.

Referenced by SCIPdisjointsetClear(), SCIPdisjointsetFind(), SCIPdisjointsetFree(), and SCIPdisjointsetUnion().

sizes

int* SCIP_DisjointSet::sizes

array to store the size of the subtree rooted at each vertex

Definition at line 280 of file struct_misc.h.

Referenced by SCIPdisjointsetClear(), SCIPdisjointsetFree(), and SCIPdisjointsetUnion().

size

int SCIP_DisjointSet::size

the number of vertices in the graph

Definition at line 281 of file struct_misc.h.

Referenced by SCIPdisjointsetClear(), SCIPdisjointsetFree(), SCIPdisjointsetGetSize(), and SCIPdisjointsetUnion().

componentcount

int SCIP_DisjointSet::componentcount

counter for the number of connected components of the graph

Definition at line 282 of file struct_misc.h.

Referenced by SCIPdisjointsetClear(), SCIPdisjointsetGetComponentCount(), and SCIPdisjointsetUnion().