/// <summary>
/// Merges the sets represented by this node and the other node into a single set.
/// Returns whether or not the nodes were disjoint before the union operation (i.e. if the operation had an effect).
/// </summary>
/// <returns>True when the union had an effect, false when the nodes were already in the same set.</returns>
public bool Union(UnionFindNode other)
{
if (other == null)
{
throw new ArgumentNullException("other");
}
var root1 = Find();
var root2 = other.Find();
if (ReferenceEquals(root1, root2))
{
return(false);
}
if (root1.rank < root2.rank)
{
root1.parent = root2;
}
else if (root1.rank > root2.rank)
{
root2.parent = root1;
}
else
{
root2.parent = root1;
root1.rank++;
}
return(true);
}
/// <summary>
/// Returns the current representative of the set this node is in.
/// Note that the representative is only accurate untl the next Union operation.
/// </summary>
public UnionFindNode Find()
{
if (!ReferenceEquals(parent, this))
{
parent = parent.Find();
}
return(parent);
}
/// <summary>
/// Determines whether or not this node and the other node are in the same set.
/// </summary>
public bool IsUnionedWith(UnionFindNode other)
{
if (other == null)
{
throw new ArgumentNullException("other");
}
return(ReferenceEquals(Find(), other.Find()));
}
/// <summary>
/// Creates a new disjoint node, representative of a set containing only the new node.
/// </summary>
public UnionFindNode()
{
parent = this;
}