public static void Main()
        {
            PriorityQueue<Person> people = new PriorityQueue<Person>();
            people.Enquene(new Person("Samuel", 25));
            people.Enquene(new Person("Sancho", 27));
            people.Enquene(new Person("Grigor", 30));
            people.Enquene(new Person("Asya", 24));
            people.Enquene(new Person("Gergana", 35));
            people.Enquene(new Person("Maria", 22));
            people.Enquene(new Person("Pesho", int.MinValue));

            Console.WriteLine("The root: {0}", people.Root);

            while (people.Count > 0)
            {
                Console.WriteLine(people.Dequene());
            }
        }
        public static void Main()
        {
            PriorityQueue <Person> people = new PriorityQueue <Person>();

            people.Enquene(new Person("Samuel", 25));
            people.Enquene(new Person("Sancho", 27));
            people.Enquene(new Person("Grigor", 30));
            people.Enquene(new Person("Asya", 24));
            people.Enquene(new Person("Gergana", 35));
            people.Enquene(new Person("Maria", 22));
            people.Enquene(new Person("Pesho", int.MinValue));

            Console.WriteLine("The root: {0}", people.Root);

            while (people.Count > 0)
            {
                Console.WriteLine(people.Dequene());
            }
        }
示例#3
0
        public static void Main()
        {
            //Implement a class PriorityQueue<T> based on the data structure "binary heap".

            PriorityQueue<Person> people = new PriorityQueue<Person>();
            people.Enquene(new Person("Doncho", 28));
            people.Enquene(new Person("Niki", 27));
            people.Enquene(new Person("Ivo", 29));
            people.Enquene(new Person("Asya", 24));
            people.Enquene(new Person("Ivo1", 35));
            people.Enquene(new Person("Asya1", 22));
            people.Enquene(new Person("Pesho", int.MinValue));

            Console.WriteLine("The root: {0}", people.Root);

            while (people.Count > 0)
            {
                Console.WriteLine(people.Dequene());
            }
        }
示例#4
0
        public static void Main()
        {
            //Implement a class PriorityQueue<T> based on the data structure "binary heap".

            PriorityQueue <Person> people = new PriorityQueue <Person>();

            people.Enquene(new Person("Doncho", 28));
            people.Enquene(new Person("Niki", 27));
            people.Enquene(new Person("Ivo", 29));
            people.Enquene(new Person("Asya", 24));
            people.Enquene(new Person("Ivo1", 35));
            people.Enquene(new Person("Asya1", 22));
            people.Enquene(new Person("Pesho", int.MinValue));

            Console.WriteLine("The root: {0}", people.Root);

            while (people.Count > 0)
            {
                Console.WriteLine(people.Dequene());
            }
        }