net.walend.disentangle.heap

Members list

Concise view

Type members

Classlikes

class FibonacciHeap[K, V](comparator: HeapOrdering[K]) extends Heap[K, V]

A generic Fibonacci heap

A generic Fibonacci heap

Attributes

Since:

v0.0.0

Companion:
object
Graph
Supertypes
trait Heap[K, V]
class Object
trait Matchable
class Any

Attributes

Companion:
class
Graph
Supertypes
class Object
trait Matchable
class Any
Self type
trait Heap[K, V]

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

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]
object Heap

Attributes

Companion:
trait
Graph
Supertypes
class Object
trait Matchable
class Any
Self type
Heap.type
trait HeapOrdering[K] extends PartialOrdering[K]

The heap moves the greatest value to the top, according to some HeapOrdering.

The heap moves the greatest value to the top, according to some HeapOrdering.

Attributes

K

the key type in this heap map.

Graph
Supertypes
trait PartialOrdering[K]
trait Equiv[K]
trait Serializable
class Object
trait Matchable
class Any
Known subtypes
object MinDoubleHeapOrdering extends HeapOrdering[Double]

A heap ordering that puts the least Double on top.

A heap ordering that puts the least Double on top.

If you imitate this code, observe that lteq and tryCompare find the inverse of what you'd have for MaxDoubleHeapOrdering.

Attributes

Graph
Supertypes
trait HeapOrdering[Double]
trait PartialOrdering[Double]
trait Equiv[Double]
trait Serializable
class Object
trait Matchable
class Any
Self type