C++ (Cpp) DisjointSets::FindSet Examples

Example #1

File: boruvka.cpp Project: TiagoJustino/graph_mst

static list<int> listElements(const DisjointSets &ds, int set)
{
    list<int> elements;
    for (int i = 0; i < ds.NumElements(); ++i)
    {
        if (ds.FindSet(i) == ds.FindSet(set))
            elements.push_front(i);
    }
    return elements;
}

Example #2

File: boruvka.cpp Project: TiagoJustino/graph_mst

static list<int> listSets(const DisjointSets &ds)
{
    list<int> sets;
    for (int i = 0; i < ds.NumElements(); ++i)
    {
        if (ds.FindSet(i) == i)
            sets.push_front(i);
    }
    return sets;
}

Example #3

File: UnionFind.cpp Project: abhi95/Automata-Equivalence

void printElementSets(const DisjointSets & s)
{
	for (int i = 0; i < s.NumElements(); ++i)
		cout << s.FindSet(i) << "  ";
	cout << endl;
}