class Mazebot::PriorityQueue(K, V)

Overview

A very simple priority key implementation to help our Dijkstra algorithm.

Defined in:

mazebot/priority_queue.cr

Constructors

.new

Instance Method Summary

#any?
#insert(key : K, value : V)
#remove_min

Constructor Detail

def self.new #

[View source]

Instance Method Detail

def any? #

[View source]

def insert(key : K, value : V) #

[View source]

def remove_min #

[View source]