Detailed Description
a weighted-quick-union-path-compression union find structure
Definition at line 78 of file misc_stp.h.
#include <misc_stp.h>
Data Fields | |
int * | parent |
int * | size |
int | nComponents |
int | nElements |
Field Documentation
◆ parent
int* UnionFind_Structure::parent |
parent[i] stores the parent of i
Definition at line 80 of file misc_stp.h.
Referenced by lca(), SCIPStpunionfindClear(), SCIPStpunionfindFind(), SCIPStpunionfindFreeMembers(), SCIPStpunionfindInit(), SCIPStpunionfindIsClear(), and SCIPStpunionfindUnion().
◆ size
int* UnionFind_Structure::size |
size[i] stores number of nodes in the tree rooted at i
Definition at line 81 of file misc_stp.h.
Referenced by SCIPStpunionfindClear(), SCIPStpunionfindFreeMembers(), SCIPStpunionfindInit(), SCIPStpunionfindIsClear(), and SCIPStpunionfindUnion().
◆ nComponents
int UnionFind_Structure::nComponents |
number of components
Definition at line 82 of file misc_stp.h.
Referenced by SCIPStpunionfindClear(), SCIPStpunionfindFreeMembers(), SCIPStpunionfindInit(), SCIPStpunionfindIsClear(), and SCIPStpunionfindUnion().
◆ nElements
int UnionFind_Structure::nElements |
number of elements
Definition at line 83 of file misc_stp.h.
Referenced by localKeyVertexHeuristics(), SCIPStpunionfindClear(), SCIPStpunionfindFreeMembers(), SCIPStpunionfindInit(), and SCIPStpunionfindIsClear().