public static void Test_3(input_test_3 A1, out output_test_3 B1)
        {
            int number_of_nodes;

            B1 = new output_test_3(A1.number_of_increasments);
            Stopwatch S = new Stopwatch();

            S.Start();
            Random r = new Random();
            int    i1, i2;

            for (i1 = 0; i1 < A1.number_of_increasments; i1++)
            {
                number_of_nodes        = A1.starting_number_of_nodes + A1.incresement_of_nodes * i1;
                B1.number_of_nodes[i1] = number_of_nodes;
                for (i2 = 0; i2 < A1.repeatings_for_each_case; i2++)
                {
                    bool[,] F_1_Adjancy_Matrix = Class2.Create_Random_Adjancy_Matrix(number_of_nodes, r);
                    bool[,] F_2_Adjancy_Matrix;
                    if (A1.are_isomorphic)
                    {
                        F_2_Adjancy_Matrix = Class2.Permute(F_1_Adjancy_Matrix, r);
                    }
                    else
                    {
                        F_2_Adjancy_Matrix = Class2.Create_Random_Adjancy_Matrix(number_of_nodes, r);
                    }
                    S.Restart();
                    bool result = Graph_Functions.Graph_Isomorphism(Graph_Functions.To_Adjency_Lists_From_Adjency_Matrix(F_1_Adjancy_Matrix), Graph_Functions.To_Adjency_Lists_From_Adjency_Matrix(F_2_Adjancy_Matrix));
                    long time   = S.ElapsedMilliseconds;
                    B1.average_times[i1] += (double)time;
                }
                B1.average_times[i1] /= A1.repeatings_for_each_case;
            }
        }
        public static void Test_2_NOT_isomorphic_samples(int n)
        {
            Random    r  = new Random();
            Stopwatch t1 = new Stopwatch();

            bool[,] F_1_Adjancy_Matrix = Class2.Create_Random_Adjancy_Matrix(n, r);
            bool[,] F_2_Adjancy_Matrix = Class2.Create_Random_Adjancy_Matrix(n, r);
            t1.Start();
            bool is_isomorphic = Graph_Functions.Graph_Isomorphism(Graph_Functions.To_Adjency_Lists_From_Adjency_Matrix(F_1_Adjancy_Matrix), Graph_Functions.To_Adjency_Lists_From_Adjency_Matrix(F_2_Adjancy_Matrix));
            long time          = t1.ElapsedMilliseconds;

            Console.WriteLine(
                "\n\nNot isomorphic samples"
                + "\nnumber of nodes:" + n.ToString().PadLeft(10)
                + "\ntime in miliseconds:" + time.ToString().PadLeft(10));
            Console.WriteLine("///  " + !is_isomorphic);
        }
        public static void Test_7()
        {
            Random    r  = new Random();
            Stopwatch t1 = new Stopwatch();

            bool[,] F_1_Adjancy_Matrix;
            F_1_Adjancy_Matrix         = Class2.F1(5, 50);
            bool[,] F_2_Adjancy_Matrix = Class2.Permute(F_1_Adjancy_Matrix, r);
            t1.Start();
            bool is_isomorphic = Graph_Functions.Graph_Isomorphism(
                Graph_Functions.To_Adjency_Lists_From_Adjency_Matrix(F_1_Adjancy_Matrix),
                Graph_Functions.To_Adjency_Lists_From_Adjency_Matrix(F_2_Adjancy_Matrix));
            long time = t1.ElapsedMilliseconds;

            Console.WriteLine(
                "\n\nTest_7"
                + "\ntime in miliseconds:" + time.ToString().PadLeft(10));
            Console.WriteLine("///  " + is_isomorphic);
        }