Heap

Материал из WikiGrapp
Версия от 15:56, 17 мая 2011; Glk (обсуждение | вклад) (Новая страница: «'''Heap''' --- куча. A '''heap''' is an abstract data structure consisting of a set of items, each with a real-valued key, subject to the following operations:…»)
(разн.) ← Предыдущая версия | Текущая версия (разн.) | Следующая версия → (разн.)

Heap --- куча.

A heap is an abstract data structure consisting of a set of items, each with a real-valued key, subject to the following operations: make heap, insert(i,h), find min(h), delete min(h).

See also

  • Fibonacci heap.