Satsuma.IDisjointSet< T > Interface Template Reference

Interface to a disjoint-set data structure. More...

Inheritance diagram for Satsuma.IDisjointSet< T >:

Public Member Functions
void	Clear ()
	Reverts the object to its default state. More...
IEnumerable< T >	Elements (DisjointSetSet< T > aSet)
	Returns the elements of a set. More...
DisjointSetSet< T >	Union (DisjointSetSet< T > a, DisjointSetSet< T > b)
	Merges two sets and returns the merged set. More...
DisjointSetSet< T >	WhereIs (T element)
	Returns the set where the given element belongs. More...

Detailed Description

Interface to a disjoint-set data structure.

In its default state the disjoint-set is discretized, i.e. each point forms a one-element set. Clear reverts the data structure to this state.

Definition at line 86 of file DisjointSet.cs.

Member Function Documentation

void Satsuma.IClearable.Clear ( )

inherited

Reverts the object to its default state.

Implemented in Satsuma.IO.GraphML.DictionaryProperty< T >, Satsuma.NetworkSimplex, Satsuma.Path, Satsuma.Supergraph, Satsuma.DisjointSet< T >, Satsuma.PriorityQueue< TElement, TPriority >, Satsuma.MaximumMatching, and Satsuma.Matching.

IEnumerable<T> Satsuma.IReadOnlyDisjointSet< T >.Elements ( DisjointSetSet< T >  aSet )

inherited

Returns the elements of a set.

Implemented in Satsuma.DisjointSet< T >.

DisjointSetSet<T> Satsuma.IDisjointSet< T >.Union	(	DisjointSetSet< T >	a,
		DisjointSetSet< T >	b
	)

Merges two sets and returns the merged set.

Implemented in Satsuma.DisjointSet< T >.

DisjointSetSet<T> Satsuma.IReadOnlyDisjointSet< T >.WhereIs ( T  element )

inherited

Returns the set where the given element belongs.

Implemented in Satsuma.DisjointSet< T >.

---

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

• src/DisjointSet.cs