queue

type Item struct {
	ItemId      int // node id of this item
	Priority    int // distance from origin to this node
	Predecessor int // node id of the predecessor
	Index       int // index of the item in the heap
}

type MinHeap[T Priorizable] struct {
	Queue   PriorityQueue // hold the priority queue
	Storage []T           // may or may not contain the items in the priority queue. Indexable directly by the ID
}

type PriorityQueue []Priorizable

type Priorizable interface {
	Priority() int
	Index() int
	SetIndex(index int)
	String() string
}

type Queue []*Item