Fast representation for disjoint sets. More...

Public Member Functions
	MyUnionFind ()

	MyUnionFind (int initialSize)

void	Resize (int count=0)

unsafe void	Clear ()

unsafe void	Union (int a, int b)

unsafe int	Find (int a)

Detailed Description

Fast representation for disjoint sets.

This data structure guarantees virtually constant time operations for union and finding the representative element of disjoint sets.

Still wondering weather the iterator makes sence

Definition at line 24 of file MyUnionFind.cs.

Constructor & Destructor Documentation

VRage.Algorithms.MyUnionFind.MyUnionFind ( )

inline

Definition at line 41 of file MyUnionFind.cs.

VRage.Algorithms.MyUnionFind.MyUnionFind ( int initialSize )

inline

Definition at line 44 of file MyUnionFind.cs.

unsafe void VRage.Algorithms.MyUnionFind.Clear ( )

inline

Definition at line 59 of file MyUnionFind.cs.

unsafe int VRage.Algorithms.MyUnionFind.Find ( int a )

inline

Definition at line 160 of file MyUnionFind.cs.

void VRage.Algorithms.MyUnionFind.Resize ( int count = 0 )

inline

Definition at line 49 of file MyUnionFind.cs.

unsafe void VRage.Algorithms.MyUnionFind.Union	(	int	a,
		int	b
	)

inline

Definition at line 69 of file MyUnionFind.cs.

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