static void Compute() { char[] split = { '\n', '\r' }; var input = TestCase.Properties.Resources.mediumUF.Split(split, StringSplitOptions.RemoveEmptyEntries); var size = int.Parse(input[0]); var quickFind = new QuickFindUF(size); var quickUnion = new QuickUnionUF(size); string[] pair; int p, q; var quickFindResult = new int[size]; var quickUnionResult = new int[size]; for (var i = 1; i < size; i++) { pair = input[i].Split(' '); p = int.Parse(pair[0]); q = int.Parse(pair[1]); quickFind.Union(p, q); quickUnion.Union(p, q); quickFindResult[i - 1] = quickFind.ArrayVisitCount; quickUnionResult[i - 1] = quickUnion.ArrayVisitCount; quickFind.ResetArrayCount(); quickUnion.ResetArrayCount(); } Draw(quickFindResult); Draw(quickUnionResult); }
public void testUnionAndConnected_MultiConnection() { QuickUnionUF quickUnionUF = new QuickUnionUF(10); quickUnionUF.Union(0, 1); quickUnionUF.Union(2, 1); Assert.IsTrue(quickUnionUF.Connected(0, 1)); Assert.IsTrue(quickUnionUF.Connected(2, 1)); Assert.IsTrue(quickUnionUF.Connected(2, 0)); Assert.AreEqual(8, quickUnionUF.Count()); Assert.AreEqual(1, quickUnionUF.Find(1)); Assert.AreEqual(1, quickUnionUF.Find(0)); Assert.AreEqual(1, quickUnionUF.Find(2)); quickUnionUF.Union(2, 5); Assert.IsTrue(quickUnionUF.Connected(0, 1)); Assert.IsTrue(quickUnionUF.Connected(2, 1)); Assert.IsTrue(quickUnionUF.Connected(2, 0)); Assert.IsTrue(quickUnionUF.Connected(5, 0)); Assert.IsTrue(quickUnionUF.Connected(5, 1)); Assert.IsTrue(quickUnionUF.Connected(5, 2)); Assert.AreEqual(7, quickUnionUF.Count()); Assert.AreEqual(5, quickUnionUF.Find(1)); Assert.AreEqual(5, quickUnionUF.Find(0)); Assert.AreEqual(5, quickUnionUF.Find(2)); Assert.AreEqual(5, quickUnionUF.Find(5)); }
public void A_big_test() { var uf = new QuickUnionUF(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(1, uf.Nodes[0]); Assert.Equal(8, uf.Nodes[1]); Assert.Equal(1, uf.Nodes[2]); Assert.Equal(8, uf.Nodes[3]); Assert.Equal(3, uf.Nodes[4]); Assert.Equal(0, uf.Nodes[5]); Assert.Equal(5, uf.Nodes[6]); Assert.Equal(1, uf.Nodes[7]); Assert.Equal(8, uf.Nodes[8]); Assert.Equal(8, uf.Nodes[9]); }
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 Connect_4_with_3_and_3_with_8_and_9_with_4() { var uf = new QuickUnionUF(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(8, uf.Nodes[i]); } else if (i == 4) { Assert.Equal(3, uf.Nodes[i]); } else if (i == 9) { Assert.Equal(8, uf.Nodes[i]); } else { Assert.Equal(i, uf.Nodes[i]); } } }
public int MakeConnected(int n, int[][] connections) { if (connections.Length < n - 1) { return(-1); } QuickUnionUF uf = new QuickUnionUF(n); int p; int q; for (int i = 0; i < connections.Length; i++) { p = connections[i][0]; q = connections[i][1]; if (uf.Find(p) != uf.Find(q)) { uf.Uunion(p, q); } } int requiredEdges = uf.Count - 1; return(requiredEdges); }
static void Main(string[] args) { string[] input = "9-0 3-4 5-8 7-2 2-1 5-7 0-3 4-2".Split(' '); var quickUnion = new QuickUnionUF(10); foreach (string s in input) { quickUnion.ResetArrayCount(); string[] numbers = s.Split('-'); int p = int.Parse(numbers[0]); int q = int.Parse(numbers[1]); quickUnion.Union(p, q); int[] parent = quickUnion.GetParent(); for (int i = 0; i < parent.Length; i++) { if (parent[i] == i) { Console.WriteLine("|---- " + i); DFS(parent, i, 1); } } Console.WriteLine("数组访问:" + quickUnion.ArrayVisitCount); } }
public void testFind() { QuickUnionUF quickUnionUF = new QuickUnionUF(10); for (int i = 0; i < 10; i++) { Assert.AreEqual(i, quickUnionUF.Find(i)); } }
public void testUnionAndConnected_NewConnection() { QuickUnionUF quickUnionUF = new QuickUnionUF(10); Assert.IsFalse(quickUnionUF.Connected(0, 1)); Assert.AreEqual(10, quickUnionUF.Count()); quickUnionUF.Union(0, 1); Assert.IsTrue(quickUnionUF.Connected(0, 1)); Assert.AreEqual(9, quickUnionUF.Count()); Assert.AreEqual(1, quickUnionUF.Find(1)); Assert.AreEqual(1, quickUnionUF.Find(0)); }
public static void Main() { QuickUnionUF uf = new QuickUnionUF(10); Console.WriteLine("Connected (1,2): " + ((uf.Connected(1, 2) == false) ? "Passed":"Failed")); uf.Union(2, 3); Console.WriteLine("Connected (2,3): " + ((uf.Connected(2, 3) == true) ? "Passed":"Failed")); uf.Union(4, 7); uf.Union(1, 8); uf.Union(1, 7); uf.Union(2, 4); Console.WriteLine("Connected (1,4): " + ((uf.Connected(1, 4) == true) ? "Passed":"Failed")); Console.WriteLine("Connected (8,9): " + ((uf.Connected(8, 9) == false) ? "Passed":"Failed")); Console.WriteLine("Connected (3,8): " + ((uf.Connected(3, 8) == true) ? "Passed":"Failed")); Console.WriteLine("Connected (5,9): " + ((uf.Connected(5, 9) == false) ? "Passed":"Failed")); Console.WriteLine("Connected (10,9): " + ((uf.Connected(10, 9) == false) ? "Passed":"Failed")); }
public void Connect_4_with_3() { int from = 4; int to = 3; var uf = new QuickUnionUF(10); uf.Union(from, to); for (int i = 0; i < uf.Length; i++) { if (i == from) { Assert.Equal(to, uf.Nodes[i]); } else { Assert.Equal(i, uf.Nodes[i]); } } }
static void Main(string[] args) { //Quick-find QuickFindUF grid = new QuickFindUF(10); grid.Union(2, 3); grid.Union(3, 6); grid.Union(6, 5); Console.WriteLine($"Does 2 and 5 connect? {grid.Connected(2, 5)}"); Console.WriteLine($"Does 6 and 1 connect? {grid.Connected(1, 6)}"); //Quick-union QuickUnionUF quuf = new QuickUnionUF(10); quuf.Union(2, 3); quuf.Union(3, 6); quuf.Union(6, 5); Console.WriteLine($"Does 2 and 5 connect? {quuf.Connected(2, 5)}"); Console.WriteLine($"Does 6 and 1 connect? {quuf.Connected(1, 6)}"); Console.WriteLine(GreatestCommonDenominator.GetGCD(9, 0)); }
static void Main(string[] args) { var n = 2000; for (var t = 0; t < 5; t++) { var input = ErdosRenyi.Generate(n); var quickFind = new QuickFindUF(n); var quickUnion = new QuickUnionUF(n); Console.WriteLine("N:" + n); var quickFindTime = RunTest(quickFind, input); var quickUnionTime = RunTest(quickUnion, input); Console.WriteLine("quick-find 耗时(毫秒):" + quickFindTime); Console.WriteLine("quick-union 耗时(毫秒):" + quickUnionTime); Console.WriteLine("比值:" + (double)quickFindTime / quickUnionTime); Console.WriteLine(); n *= 2; } }
public void testFind_ParameterValidation_PLessThan0() { QuickUnionUF quickUnionUF = new QuickUnionUF(10); quickUnionUF.Find(-1); }
public void testUnion_ParameterValidation_QLessThan0() { QuickUnionUF quickUnionUF = new QuickUnionUF(10); quickUnionUF.Union(4, -1); }
public void testFind_ParameterValidation_PEqualN() { QuickUnionUF quickUnionUF = new QuickUnionUF(10); quickUnionUF.Find(10); }
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(); } }
static void Main(string[] args) { // 查看 UnionFound 类库里面的相关类即可。 QuickFindUF quickFindUF = new QuickFindUF(100); QuickUnionUF quickUnionUF = new QuickUnionUF(100); }
public void testConnected_ParameterValidation_QLessThan0() { QuickUnionUF quickUnionUF = new QuickUnionUF(10); quickUnionUF.Connected(4, -1); }
public void testConnected_ParameterValidation_PLargerThanN() { QuickUnionUF quickUnionUF = new QuickUnionUF(10); quickUnionUF.Connected(11, 4); }
public void testConnected_ParameterValidation_PEqualN() { QuickUnionUF quickUnionUF = new QuickUnionUF(10); quickUnionUF.Connected(10, 4); }
public void testFind_ParameterValidation_PLargerThanN() { QuickUnionUF quickUnionUF = new QuickUnionUF(10); quickUnionUF.Find(11); }
public void testUnion_ParameterValidation_QEqualN() { QuickUnionUF quickUnionUF = new QuickUnionUF(10); quickUnionUF.Union(4, 10); }
public void testUnion_ParameterValidation_QLargerThanN() { QuickUnionUF quickUnionUF = new QuickUnionUF(10); quickUnionUF.Union(4, 11); }
public void QuickUnionTest() { var UF = new QuickUnionUF(Algorithms.DynamicConnectivity.length); Run(UF, Algorithms.DynamicConnectivity.commands); }
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; } } }