UnionFind< T > Class Template Reference

#include <core/adt/union_find.h>

Classes
class	iterator

Public Member Functions
template<typename... Args>
ID< T >	Emplace (Args &&... args)
ID< T >	Union (ID< T > idA, ID< T > idB)
T *	Map (ID< T > id) const
T *	Get (ID< T > id) const
ID< T >	Find (ID< T > id) const
iterator	begin ()
	Iterator over root elements - begin.
iterator	end ()
	Iterator over root elements - end.
unsigned	Size () const
	UnionFind (unsigned n)
	Creates a new structure with a given number of sets.
void	Union (unsigned a, unsigned b)
	Joins two nodes, using the second one as the representative node.
unsigned	Find (unsigned node)
	Finds the representative class of a node.

Detailed Description

template<typename T>
class UnionFind< T >

Union-find data structure to manage nodes.

Union-Find data structure.

---

The documentation for this class was generated from the following files:

• core/adt/union_find.h
• core/analysis/union_find.cpp