|
int | find (disjoint_sets::CompressionOption< CompressionOptions::Collapsing >, int set) |
|
int | find (disjoint_sets::CompressionOption< CompressionOptions::Disabled >, int set) |
|
int | find (disjoint_sets::CompressionOption< CompressionOptions::PathCompression >, int set) |
|
int | find (disjoint_sets::CompressionOption< CompressionOptions::PathHalving >, int set) |
|
int | find (disjoint_sets::CompressionOption< CompressionOptions::PathSplitting >, int set) |
|
int | find (disjoint_sets::CompressionOption< CompressionOptions::Type1Reversal >, int set) |
|
int | link (disjoint_sets::LinkOption< LinkOptions::Index >, int set1, int set2) |
|
int | link (disjoint_sets::LinkOption< LinkOptions::Naive >, int set1, int set2) |
|
int | link (disjoint_sets::LinkOption< LinkOptions::Rank >, int set1, int set2) |
|
int | link (disjoint_sets::LinkOption< LinkOptions::Size >, int set1, int set2) |
|
int | linkPure (int set1, int set2) |
| Unions set1 and set2 w/o decreasing the numberOfSets. More...
|
|
bool | quickUnion (disjoint_sets::AnyOption, disjoint_sets::InterleavingOption< InterleavingOptions::Disabled >, int set1, int set2) |
|
bool | quickUnion (disjoint_sets::LinkOption< LinkOptions::Index >, disjoint_sets::InterleavingOption< InterleavingOptions::Rem >, int set1, int set2) |
|
bool | quickUnion (disjoint_sets::LinkOption< LinkOptions::Index >, disjoint_sets::InterleavingOption< InterleavingOptions::SplittingCompression >, int set1, int set2) |
|
bool | quickUnion (disjoint_sets::LinkOption< LinkOptions::Naive >, disjoint_sets::InterleavingOption< InterleavingOptions::Type0Reversal >, int set1, int set2) |
|
bool | quickUnion (disjoint_sets::LinkOption< LinkOptions::Rank >, disjoint_sets::InterleavingOption< InterleavingOptions::Tarjan >, int set1, int set2) |
|
template<LinkOptions linkOption = LinkOptions::Index, CompressionOptions compressionOption = CompressionOptions::PathSplitting, InterleavingOptions interleavingOption = InterleavingOptions::Disabled>
class ogdf::DisjointSets< linkOption, compressionOption, interleavingOption >
A Union/Find data structure for maintaining disjoint sets.
Definition at line 90 of file DisjointSets.h.
template<LinkOptions linkOption = LinkOptions::Index, CompressionOptions compressionOption = CompressionOptions::PathSplitting, InterleavingOptions interleavingOption = InterleavingOptions::Disabled>
Resets the DisjointSets structure to be empty, preserving the previous value of maxNumberOfElements.
Definition at line 189 of file DisjointSets.h.
template<LinkOptions linkOption = LinkOptions::Index, CompressionOptions compressionOption = CompressionOptions::PathSplitting, InterleavingOptions interleavingOption = InterleavingOptions::Disabled>
void ogdf::DisjointSets< linkOption, compressionOption, interleavingOption >::init |
( |
int |
maxNumberOfElements | ) |
|
|
inline |
template<LinkOptions linkOption = LinkOptions::Index, CompressionOptions compressionOption = CompressionOptions::PathSplitting, InterleavingOptions interleavingOption = InterleavingOptions::Disabled>
Assign this DisjointSets to be a copy of copy_by_value
.
Internally, this will use the copy constructor to create a temporary copy of the argument copy_by_value
(as it is passed by value) and then swap this object instance with the temporary copy. If the assigned-from object can be moved, the move constructor will be automatically used instead of copying. Note that this method thereby covers both copy-assignment and move-assignment. See https://stackoverflow.com/a/3279550 for more details on this idiom. This method is noexcept as a potentially-throwing copy constructor call is made within the context of the caller (see https://stackoverflow.com/a/7628345) and swap is expected to be noexcept.
Definition at line 180 of file DisjointSets.h.