Limbo 3.5.4
Loading...
Searching...
No Matches
Limbo.Containers

Introduction

Some specially designed containers for specific applications, such as disjoint set, multiple-level set, etc.

Examples

test_disjointset.cpp

#include <iostream>
int main()
{
std::vector<int> vParent (10);
std::vector<int> vRank (vParent.size());
typedef limbo::containers::DisjointSet disjoint_set_type;
disjoint_set_type::SubsetHelper<int, int> gp (vParent, vRank);
disjoint_set_type::union_set(gp, 2, 3);
disjoint_set_type::union_set(gp, 4, 6);
disjoint_set_type::union_set(gp, 5, 8);
std::cout << "number of sets = " << disjoint_set_type::count_sets(gp) << std::endl;
std::cout << "parent of subset of element 4 = " << disjoint_set_type::find_set(gp, 4) << std::endl;
disjoint_set_type::union_set(gp, 2, 4);
std::cout << "number of sets = " << disjoint_set_type::count_sets(gp) << std::endl;
std::cout << "parent of subset of element 4 = " << disjoint_set_type::find_set(gp, 4) << std::endl;
return 0;
}
A disjoint set structure and union-find utilities.
simply used for scope control
Definition DisjointSet.h:29
int main()

Compiling and running commands (assuming LIMBO_DIR is exported as the environment variable to the path where limbo library is installed)

g++ -o test_disjointset test_disjointset.cpp -I $LIMBO_DIR/include
./test_disjointset

Output

number of sets = 7
parent of subset of element 4 = 4
number of sets = 6
parent of subset of element 4 = 2

References