Offline-Min datastructure Used to compute the perfect matching between the unsorted views x and the sorted views y. More...
#include <gecode/int/sorted/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) |
Detailed Description
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.
Constructor & Destructor Documentation
◆ OfflineMin() [1/2]
| Gecode::Int::Sorted::OfflineMin::OfflineMin | ( | void | ) |
Definition at line 176 of file sortsup.hpp.
◆ OfflineMin() [2/2]
| Gecode::Int::Sorted::OfflineMin::OfflineMin | ( | OfflineMinItem | s[], |
| int | v[], | ||
| int | size ) |
Definition at line 182 of file sortsup.hpp.
Member Function Documentation
◆ find()
|
inline |
Find the set x belongs to (without path compression)
Definition at line 189 of file sortsup.hpp.
◆ find_pc()
|
inline |
Find the set x belongs to (using path compression)
Definition at line 199 of file sortsup.hpp.
◆ unite()
|
inline |
Unite two sets a and b and label the union with c.
Definition at line 215 of file sortsup.hpp.
◆ makeset()
|
inline |
Initialization of the datastructure.
Definition at line 232 of file sortsup.hpp.
◆ size()
|
inline |
Return the size of the Offline-Min item.
Definition at line 247 of file sortsup.hpp.
◆ operator[]()
|
inline |
Definition at line 252 of file sortsup.hpp.
The documentation for this class was generated from the following file:
- gecode/int/sorted/sortsup.hpp
