public void Connect_4_with_3_and_3_with_8_and_9_with_4()
{
var uf = new WeightedQuickUnionUF(10);
uf.Union(4, 3);
uf.Union(3, 8);
uf.Union(9, 4);
for (int i = 0; i < uf.Length; i++)
{
if (i == 3)
{
Assert.Equal(4, uf.Nodes[i]);
}
else if (i == 8)
{
Assert.Equal(4, uf.Nodes[i]);
}
else if (i == 9)
{
Assert.Equal(4, uf.Nodes[i]);
}
else
{
Assert.Equal(i, uf.Nodes[i]);
}
}
}
static void Compute()
{
var size = 200;
var quickFind = new QuickFindUF(size);
var quickUnion = new QuickUnionUF(size);
var weightedQuickUnion = new WeightedQuickUnionUF(size);
var connections = ErdosRenyi.Generate(size);
var quickFindResult = new int[size];
var quickUnionResult = new int[size];
var weightedQuickUnionResult = new int[size];
int p, q;
for (var i = 0; i < size; i++)
{
p = connections[i].P;
q = connections[i].Q;
quickFind.Union(p, q);
quickUnion.Union(p, q);
weightedQuickUnion.Union(p, q);
quickFindResult[i] = quickFind.ArrayVisitCount;
quickUnionResult[i] = quickUnion.ArrayVisitCount;
weightedQuickUnionResult[i] = weightedQuickUnion.ArrayParentVisitCount + weightedQuickUnion.ArraySizeVisitCount;
quickFind.ResetArrayCount();
quickUnion.ResetArrayCount();
weightedQuickUnion.ResetArrayCount();
}
Draw(quickFindResult, "Quick-Find");
Draw(quickUnionResult, "Quick-Union");
Draw(weightedQuickUnionResult, "Weighted Quick-Union");
}
public void A_big_test()
{
var uf = new WeightedQuickUnionUF(10);
uf.Union(4, 3);
uf.Union(3, 8);
uf.Union(6, 5);
uf.Union(9, 4);
uf.Union(2, 1);
Assert.True(uf.IsConnected(8, 9));
Assert.False(uf.IsConnected(5, 4));
uf.Union(5, 0);
uf.Union(7, 2);
uf.Union(6, 1);
uf.Union(7, 3);
Assert.Equal(6, uf.Nodes[0]);
Assert.Equal(2, uf.Nodes[1]);
Assert.Equal(6, uf.Nodes[2]);
Assert.Equal(4, uf.Nodes[3]);
Assert.Equal(6, uf.Nodes[4]);
Assert.Equal(6, uf.Nodes[5]);
Assert.Equal(6, uf.Nodes[6]);
Assert.Equal(6, uf.Nodes[7]);
Assert.Equal(4, uf.Nodes[8]);
Assert.Equal(4, uf.Nodes[9]);
}
public void testUnionAndConnected_MultiConnection()
{
WeightedQuickUnionUF weightedQuickUnionUF = new WeightedQuickUnionUF(10);
weightedQuickUnionUF.Union(0, 1);
weightedQuickUnionUF.Union(2, 1);
Assert.IsTrue(weightedQuickUnionUF.Connected(0, 1));
Assert.IsTrue(weightedQuickUnionUF.Connected(2, 1));
Assert.IsTrue(weightedQuickUnionUF.Connected(2, 0));
Assert.AreEqual(8, weightedQuickUnionUF.Count());
Assert.AreEqual(0, weightedQuickUnionUF.Find(1));
Assert.AreEqual(0, weightedQuickUnionUF.Find(0));
Assert.AreEqual(0, weightedQuickUnionUF.Find(2));
weightedQuickUnionUF.Union(2, 5);
Assert.IsTrue(weightedQuickUnionUF.Connected(0, 1));
Assert.IsTrue(weightedQuickUnionUF.Connected(2, 1));
Assert.IsTrue(weightedQuickUnionUF.Connected(2, 0));
Assert.IsTrue(weightedQuickUnionUF.Connected(5, 0));
Assert.IsTrue(weightedQuickUnionUF.Connected(5, 1));
Assert.IsTrue(weightedQuickUnionUF.Connected(5, 2));
Assert.AreEqual(7, weightedQuickUnionUF.Count());
Assert.AreEqual(0, weightedQuickUnionUF.Find(1));
Assert.AreEqual(0, weightedQuickUnionUF.Find(0));
Assert.AreEqual(0, weightedQuickUnionUF.Find(2));
Assert.AreEqual(0, weightedQuickUnionUF.Find(5));
}
public void testFind()
{
WeightedQuickUnionUF weightedQuickUnionUF = new WeightedQuickUnionUF(10);
for (int i = 0; i < 10; i++)
{
Assert.AreEqual(i, weightedQuickUnionUF.Find(i));
}
}
public void testUnionAndConnected_NewConnection()
{
WeightedQuickUnionUF weightedQuickUnionUF = new WeightedQuickUnionUF(10);
Assert.IsFalse(weightedQuickUnionUF.Connected(0, 1));
Assert.AreEqual(10, weightedQuickUnionUF.Count());
weightedQuickUnionUF.Union(0, 1);
Assert.IsTrue(weightedQuickUnionUF.Connected(0, 1));
Assert.AreEqual(9, weightedQuickUnionUF.Count());
Assert.AreEqual(0, weightedQuickUnionUF.Find(1));
Assert.AreEqual(0, weightedQuickUnionUF.Find(0));
}
public Percolation(int n)
{
this.n = n; //储存传入的参数n
uf = new WeightedQuickUnionUF(n * n + 2); //建立n*n+2大小的序列，第一位id为0，最后一位id为n*n+1
_uf = new WeightedQuickUnionUF(n * n + 1); //建立n*n+1大小的序列，目的是当检测系统内两点是否连接时，排除虚拟点位的干扰
//模拟开始时，除第一个点和最后一个点（两个）虚拟点位默认为开放，其余都默认关闭
opened = new bool[n * n + 2];
for (int i = 1; i < n * n + 1; i++)
{
opened[i] = false;
}
opened[0] = true;
opened[n * n + 1] = true;
}
static void RunTest(string[] input)
{
var weightedQuickUnion = new WeightedQuickUnionUF(10);
int n = int.Parse(input[0]);
int[] parent = weightedQuickUnion.GetParent();
int[] size = weightedQuickUnion.GetSize();
for (int i = 1; i < input.Length; i++)
{
string[] unit = input[i].Split(' ');
int p = int.Parse(unit[0]);
int q = int.Parse(unit[1]);
Console.WriteLine($"{p} {q}");
weightedQuickUnion.Union(p, q);
Console.Write("index:\t");
for (int j = 0; j < 10; j++)
{
Console.Write(j + " ");
}
Console.WriteLine();
Console.Write("parent:\t");
foreach (int m in parent)
{
Console.Write(m + " ");
}
Console.WriteLine();
Console.Write("size:\t");
foreach (int m in size)
{
Console.Write(m + " ");
}
Console.WriteLine();
Console.WriteLine("parent visit count:" + weightedQuickUnion.ArrayParentVisitCount);
Console.WriteLine("size visit count:" + weightedQuickUnion.ArraySizeVisitCount);
Console.WriteLine();
weightedQuickUnion.ResetArrayCount();
}
}
public void Connect_4_with_3()
{
int from = 4;
int to = 3;
var uf = new WeightedQuickUnionUF(10);
uf.Union(from, to);
for (int i = 0; i < uf.Length; i++)
{
if (i == to)
{
Assert.Equal(from, uf.Nodes[i]);
}
else
{
Assert.Equal(i, uf.Nodes[i]);
}
}
}
static void Main(string[] args)
{
var input = "9-0 3-4 5-8 7-2 2-1 5-7 0-3 4-2".Split(' ');
var weightedQuickUnion = new WeightedQuickUnionUF(10);
foreach (var s in input)
{
weightedQuickUnion.ResetArrayCount();
var numbers = s.Split('-');
var p = int.Parse(numbers[0]);
var q = int.Parse(numbers[1]);
weightedQuickUnion.Union(p, q);
var parent = weightedQuickUnion.GetParent();
for (var i = 0; i < parent.Length; i++)
{
Console.Write(parent[i] + " ");
}
Console.WriteLine("数组访问：" + weightedQuickUnion.ArrayParentVisitCount);
}
}
static void Main(string[] args)
{
var n = 10000;
for (var t = 0; t < 5; t++)
{
var input = ErdosRenyi.Generate(n);
var weightedQuickUnionUF = new WeightedQuickUnionUF(n);
var weightedQuickUnionPathCompressionUF = new WeightedQuickUnionPathCompressionUF(n);
Console.WriteLine("N:" + n);
var weightedQuickUnionTime = RunTest(weightedQuickUnionUF, input);
var weightedQuickUnionPathCompressionTime = RunTest(weightedQuickUnionPathCompressionUF, input);
Console.WriteLine("加权 quick-find 耗时（毫秒）：" + weightedQuickUnionTime);
Console.WriteLine("带路径压缩的加权 quick-union 耗时（毫秒）：" + weightedQuickUnionPathCompressionTime);
Console.WriteLine("比值：" + (double)weightedQuickUnionTime / weightedQuickUnionPathCompressionTime);
Console.WriteLine();
n *= 2;
}
}
static void Main(string[] args)
{
var n = 40;
var t = 4;
// quick-find
Console.WriteLine("Quick-Find");
long last = 0;
long now = 0;
for (var i = 0; i < t; i++, n *= 2)
{
Console.WriteLine("N:" + n * n);
var connections = RandomGrid.GetConnections(n);
var quickFind = new QuickFindUF(n * n);
now = RunTest(quickFind, connections);
if (last == 0)
{
Console.WriteLine("平均用时（毫秒）：" + now);
last = now;
}
else
{
Console.WriteLine("平均用时（毫秒）：" + now + "\t比值：" + (double)now / last);
last = now;
}
}
// quick-union
Console.WriteLine("Quick-Union");
n = 40;
for (var i = 0; i < t; i++, n *= 2)
{
Console.WriteLine("N:" + n * n);
var connections = RandomGrid.GetConnections(n);
var quickFind = new QuickUnionUF(n * n);
now = RunTest(quickFind, connections);
if (last == 0)
{
Console.WriteLine("平均用时（毫秒）：" + now);
last = now;
}
else
{
Console.WriteLine("平均用时（毫秒）：" + now + "\t比值：" + (double)now / last);
last = now;
}
}
// 加权 quick-union
Console.WriteLine("Weighted Quick-Union");
n = 40;
for (var i = 0; i < t; i++, n *= 2)
{
Console.WriteLine("N:" + n * n);
var connections = RandomGrid.GetConnections(n);
var quickFind = new WeightedQuickUnionUF(n * n);
now = RunTest(quickFind, connections);
if (last == 0)
{
Console.WriteLine("平均用时（毫秒）：" + now);
last = now;
}
else
{
Console.WriteLine("平均用时（毫秒）：" + now + "\t比值：" + (double)now / last);
last = now;
}
}
}
static void Main(string[] args)
{
long lastTimeQuickFind = 0;
long lastTimeQuickUnion = 0;
long lastTimeWeightedQuickUnion = 0;
long nowTime = 0;
for (int n = 2000; n < 100000; n *= 2)
{
Console.WriteLine("N:" + n);
QuickFindUF quickFindUF = new QuickFindUF(n);
QuickUnionUF quickUnionUF = new QuickUnionUF(n);
WeightedQuickUnionUF weightedQuickUnionUF = new WeightedQuickUnionUF(n);
// quick-find
Console.WriteLine("quick-find");
nowTime = RunTest(quickFindUF);
if (lastTimeQuickFind == 0)
{
Console.WriteLine("用时：" + nowTime);
lastTimeQuickFind = nowTime;
}
else
{
Console.WriteLine("用时：" + nowTime +
" 比值：" + (double)nowTime / lastTimeQuickFind);
lastTimeQuickFind = nowTime;
}
Console.WriteLine();
// quick-union
Console.WriteLine("quick-union");
nowTime = RunTest(quickUnionUF);
if (lastTimeQuickUnion == 0)
{
Console.WriteLine("用时：" + nowTime);
lastTimeQuickUnion = nowTime;
}
else
{
Console.WriteLine("用时：" + nowTime +
" 比值：" + (double)nowTime / lastTimeQuickUnion);
lastTimeQuickUnion = nowTime;
}
Console.WriteLine();
// weighted-quick-union
Console.WriteLine("weighted-quick-union");
nowTime = RunTest(weightedQuickUnionUF);
if (lastTimeWeightedQuickUnion == 0)
{
Console.WriteLine("用时：" + nowTime);
lastTimeWeightedQuickUnion = nowTime;
}
else
{
Console.WriteLine("用时：" + nowTime +
" 比值：" + (double)nowTime / lastTimeWeightedQuickUnion);
lastTimeWeightedQuickUnion = nowTime;
}
Console.WriteLine();
Console.WriteLine();
}
}
public void testConnected_ParameterValidation_QLessThan0()
{
WeightedQuickUnionUF weightedQuickUnionUF = new WeightedQuickUnionUF(10);
weightedQuickUnionUF.Connected(4, -1);
}
public void testUnion_ParameterValidation_PLessThan0()
{
WeightedQuickUnionUF weightedQuickUnionUF = new WeightedQuickUnionUF(10);
weightedQuickUnionUF.Union(-1, 4);
}
public void testConnected_ParameterValidation_PEqualN()
{
WeightedQuickUnionUF weightedQuickUnionUF = new WeightedQuickUnionUF(10);
weightedQuickUnionUF.Connected(10, 4);
}
public void testConnected_ParameterValidation_PLargerThanN()
{
WeightedQuickUnionUF weightedQuickUnionUF = new WeightedQuickUnionUF(10);
weightedQuickUnionUF.Connected(11, 4);
}
public void testUnion_ParameterValidation_QLargerThanN()
{
WeightedQuickUnionUF weightedQuickUnionUF = new WeightedQuickUnionUF(10);
weightedQuickUnionUF.Union(4, 11);
}
public void testUnion_ParameterValidation_QEqualN()
{
WeightedQuickUnionUF weightedQuickUnionUF = new WeightedQuickUnionUF(10);
weightedQuickUnionUF.Union(4, 10);
}
public void testFind_ParameterValidation_PLessThan0()
{
WeightedQuickUnionUF weightedQuickUnionUF = new WeightedQuickUnionUF(10);
weightedQuickUnionUF.Find(-1);
}
public void testFind_ParameterValidation_PEqualN()
{
WeightedQuickUnionUF weightedQuickUnionUF = new WeightedQuickUnionUF(10);
weightedQuickUnionUF.Find(10);
}
public void testFind_ParameterValidation_PLargerThanN()
{
WeightedQuickUnionUF weightedQuickUnionUF = new WeightedQuickUnionUF(10);
weightedQuickUnionUF.Find(11);
}
