static void BinaryTree_GetBestCities_Test()
        {
            BinaryTree binaryTree = new BinaryTree(1, 1);

            binaryTree.Insert(CitiesInfo.Cities[2]);
            binaryTree.Insert(CitiesInfo.Cities[3]);
            binaryTree.Insert(CitiesInfo.Cities[4]);
            binaryTree.Insert(CitiesInfo.Cities[5]);

            TwoWayLinkedList cities = binaryTree.GetBestCities(2);

            foreach (City city in cities)
            {
                Console.WriteLine(city.ToString());
            }
            Console.WriteLine();

            binaryTree.Insert(CitiesInfo.Cities[0]);
            binaryTree.Insert(CitiesInfo.Cities[1]);

            TwoWayLinkedList cities1 = binaryTree.GetBestCities(4);

            foreach (City city in cities1)
            {
                Console.WriteLine(city.ToString());
            }
        }
        static void BinaryTree_BestCitiesByPopulationYounger20_Test()
        {
            BinaryTree binaryTree = new BinaryTree(1, 1);

            binaryTree.Insert(CitiesInfo.Cities[2]);
            binaryTree.Insert(CitiesInfo.Cities[3]);
            binaryTree.Insert(CitiesInfo.Cities[4]);
            binaryTree.Insert(CitiesInfo.Cities[5]);

            TwoWayLinkedList cities = binaryTree.BestCitiesByPopulationYounger20(0, 100000000, 3);

            foreach (City city in cities)
            {
                Console.WriteLine(city.ToString());
            }
            Console.WriteLine();

            binaryTree.Insert(CitiesInfo.Cities[0]);
            binaryTree.Insert(CitiesInfo.Cities[1]);

            TwoWayLinkedList cities1 = binaryTree.BestCitiesByPopulationYounger20(0, 1000, 3);

            foreach (City city in cities1)
            {
                Console.WriteLine(city.ToString());
            }
        }
Exemple #3
0
        static void Main(string[] args)
        {
            TwoWayLinkedList <Minion> minions = new TwoWayLinkedList <Minion>();

            minions.Add(new Minion(1, "Brad", 21, 1));
            minions.Add(new Minion(2, "Jhony", 32, 3));
            minions.Add(new Minion(3, "Georgy", 41, 2));

            minions.InsertBefore(new Minion(4, "Penny", 27, 4), 1);
            minions.RemoveAt(5);

            Console.WriteLine(minions);
        }
        static void GetRouteTest()
        {
            WayCreator       wayCreator   = new WayCreator();
            TwoWayLinkedList chosenCities = new TwoWayLinkedList();
            City             startPoint   = CitiesInfo.Cities[0]; // Berlin

            chosenCities.PushLast(CitiesInfo.Cities[1]);          // Kiev
            chosenCities.PushLast(CitiesInfo.Cities[6]);          // Budapesht
            chosenCities.PushLast(CitiesInfo.Cities[2]);          // Minsk
            //chosenCities.PushLast(CitiesInfo.Cities()[3]); // Warsaw
            chosenCities.PushLast(CitiesInfo.Cities[5]);          // Vien
            chosenCities.PushLast(CitiesInfo.Cities[4]);          // Prague
            TwoWayLinkedList route = wayCreator.GetRoute(chosenCities, startPoint);
            int index = 1;

            foreach (City city in route)
            {
                Console.WriteLine(index++.ToString() + ". " + city.Name);
            }
        }
        static void CitiesInfo_Distances_NewTest()
        {
            WayCreator       wayCreator   = new WayCreator();
            Random           random       = new Random();
            TwoWayLinkedList chosenCities = new TwoWayLinkedList();
            City             startPoint   = CitiesInfo.Cities[0];

            foreach (City city in CitiesInfo.Cities)
            {
                if (!chosenCities.Contains(city))
                {
                    chosenCities.PushLast(city);
                }
            }
            TwoWayLinkedList route = wayCreator.GetRoute(chosenCities, startPoint);
            int index = 1;

            foreach (City city in route)
            {
                Console.WriteLine(index++.ToString() + ". " + city.Name);
            }
        }
        static void Main(string[] args)
        {
            TwoWayLinkedList lst   = new TwoWayLinkedList();
            City             city1 = new City("1", 9, 4);
            City             city2 = new City("2", 14, 8);
            City             city3 = new City("3", 231, 2);
            City             city4 = new City("4", 2, 3);
            City             city5 = new City("5", 3, 4);
            City             city6 = new City("6", 5, 8);
            City             city7 = new City("7", 26, 2);
            City             city8 = new City("8", 23, 4);

            lst.PushLast(city5);
            lst.PushLast(city6);
            lst.PushLast(city7);
            lst.PushLast(city8);
            lst.PushLast(city1);
            lst.PushLast(city2);
            lst.PushLast(city3);
            lst.PushLast(city4);

            lst.DelByName("1");
            lst.DelByName("2");
            lst.DelByName("3");
            lst.DelByName("4");
            lst.DelByName("5");
            lst.DelByName("6");
            lst.DelByName("7");
            lst.DelByName("8");
            foreach (var item in lst)
            {
                Console.WriteLine(item.Name);
            }
            //CitiesInfo_Distances_NewTest();
            Console.ReadKey();
        }
Exemple #7
0
 /// <summary>
 /// Конструкторы
 /// </summary>
 public LinkedListDeque()
 {
     items = new TwoWayLinkedList <T>();
 }
        static void TwoWayLinkedListTest()
        {
            City             city1 = new City("1", 9, 4);
            City             city2 = new City("2", 14, 8);
            City             city3 = new City("3", 231, 2);
            City             city4 = new City("4", 2, 4);
            TwoWayLinkedList tl    = new TwoWayLinkedList();

            tl.PushLast(city1);
            //Console.WriteLine(tl.last.data.Name + "dasda");
            tl.PushLast(city2);
            //Console.WriteLine(tl.last.data.Name + "dasda");
            tl.PushLast(city3);
            //Console.WriteLine(tl.last.data.Name + "dasda");
            tl.PushLast(city4);
            //Console.WriteLine(tl.last.data.Name + "dasda");
            TwoWayLinkedList lst   = new TwoWayLinkedList();
            City             city5 = new City("5", 3, 4);
            City             city6 = new City("6", 5, 8);
            City             city7 = new City("7", 26, 2);
            City             city8 = new City("8", 23, 4);

            lst.PushLast(city5);
            lst.PushLast(city6);
            lst.PushLast(city7);
            lst.PushLast(city8);
            lst.Concatenation(tl);
            //lst.PushLast(city1);

            //tl.Concatenation(lst);
            //Console.WriteLine(tl.last.data.Name + "dasda");
            //Console.WriteLine(tl.head.data.Name + "dasda");
            //tl.Concatenation(tl, lst);

            //foreach (var item in tl)
            //{
            //   Console.WriteLine(item.Name);
            //   Console.WriteLine(tl.last.data.Name + "dasda");
            //}
            foreach (var item in lst)
            {
                Console.WriteLine(item.AmountPeople);
            }
            Console.WriteLine("dasda");
            lst.QuickSortAmountPeople();
            foreach (var item in lst)
            {
                Console.WriteLine(item.AmountPeople);
            }

            Console.WriteLine(tl.IndexOf(city2));
            Console.WriteLine(tl.Contains(city2));
            Console.WriteLine(tl.Contains(new City("popopo", 111, 222)));
            //Console.WriteLine(tl.head.data.Name);
            //TwoWayLinkedList empt = new TwoWayLinkedList();
            //TwoWayLinkedList empt2 = new TwoWayLinkedList();
            //TwoWayLinkedList help = new TwoWayLinkedList();



            //lst.Concatenation(tl);
            //lst.Concatenation(empt);
            //lst.Concatenation(help);

            //foreach (City item in lst)
            //{
            //   Console.WriteLine(item.AmountPeople);
            //}
        }