private NodeTreeLink <double> GetTopLevelNode(
int index_element)
{
if (!top_assignments.ContainsKey(index_element))
{
return(null);
}
else
{
NodeTreeLink <double> node = top_assignments[index_element];
if (node.get_parent() == null)
{
return(node);
}
else
{
do
{
node = node.get_parent();
}while (node.get_parent() != null);
top_assignments[index_element] = node;
return(node);
}
}
}
public void Merge(
double value,
int index_element_0,
int index_element_1)
{
NodeTreeLink <double> node_0 = GetTopLevelNode(index_element_0);
NodeTreeLink <double> node_1 = GetTopLevelNode(index_element_1);
if (node_0 == null)
{
if (node_1 == null)
{
// if both nodes are the same do nothing other wize add a new node
NodeTreeLink <double> node_new = new NodeTreeLink <double>(value, index_element_0, index_element_1);
top_assignments[index_element_0] = node_new;
top_assignments[index_element_1] = node_new;
ClusterCount--;
}
else
{
NodeTreeLink <double> node_new = new NodeTreeLink <double>(value, index_element_0, node_1);
top_assignments[index_element_0] = node_new;
top_assignments[index_element_1] = node_new;
ClusterCount--;
}
}
else
{
if (node_1 == null)
{
// if both nodes are the same do nothing other wize add a new node
NodeTreeLink <double> node_new = new NodeTreeLink <double>(value, index_element_1, node_0);
top_assignments[index_element_0] = node_new;
top_assignments[index_element_1] = node_new;
ClusterCount--;
}
else
{
// Both are noded
if (node_0 != node_1)
{
NodeTreeLink <double> node_new = new NodeTreeLink <double>(value, node_0, node_1);
top_assignments[index_element_0] = node_new;
top_assignments[index_element_1] = node_new;
ClusterCount--;
}
else
{
return; // already merged
}
}
}
}
