Disentangle-Graph
API
Generated with
Disentangle-Graph/net.walend.disentangle.heap/Heap

Heap

net.walend.disentangle.heap.Heap
See theHeap companion object
trait Heap[K, V]

A structure that makes an extreme key of some key,value pair available

Attributes

Since:

v0.0.0

Companion:
object
Graph
Supertypes
class Object
trait Matchable
class Any
Known subtypes
class FibonacciHeap[K, V]

Members list

Concise view

Type members

Classlikes

trait HeapMember

Attributes

Graph
Supertypes
class Object
trait Matchable
class Any
Known subtypes

Value members

Abstract methods

def insert(key: K, value: V): HeapMember
def isEmpty: Boolean
def takeTopValue(): V
def topKey: K
def topValue: V
Generated with