Offline-Min datastructure Used to compute the perfect matching between the unsorted views x and the sorted views y. More...
#include <sortsup.hpp>
Public Member Functions | |
OfflineMin (void) | |
OfflineMin (OfflineMinItem[], int[], int) | |
int | find (int x) |
int | find_pc (int x) |
void | unite (int a, int b, int c) |
Unite two sets a and b and label the union with c. | |
void | makeset (void) |
Initialization of the datastructure. | |
int | size (void) |
Return the size of the Offline-Min item. | |
OfflineMinItem & | operator[] (int) |
Offline-Min datastructure Used to compute the perfect matching between the unsorted views x and the sorted views y.
Definition at line 146 of file sortsup.hpp.
Gecode::Int::Sorted::OfflineMin::OfflineMin | ( | void | ) |
Definition at line 173 of file sortsup.hpp.
Gecode::Int::Sorted::OfflineMin::OfflineMin | ( | OfflineMinItem | s[], |
int | v[], | ||
int | size ) |
Definition at line 179 of file sortsup.hpp.
|
inline |
Find the set x belongs to (wihtout path compression)
Definition at line 186 of file sortsup.hpp.
|
inline |
Find the set x belongs to (using path compression)
Definition at line 196 of file sortsup.hpp.
|
inline |
Unite two sets a and b and label the union with c.
Definition at line 210 of file sortsup.hpp.
|
inline |
Initialization of the datastructure.
Definition at line 227 of file sortsup.hpp.
|
inline |
Return the size of the Offline-Min item.
Definition at line 241 of file sortsup.hpp.
|
inline |
Definition at line 246 of file sortsup.hpp.