# Struct BinaryHeap

Public

Binary heap implementation.

Binary heaps are really fast for ordering nodes in a way that makes it possible to get the node with the lowest F score. Also known as a priority queue.

This has actually been rewritten as a 4-ary heap for performance, but it's the same principle.

## Inner Types

## Public Methods

## Public Static Methods

## Public Variables

isEmpty

True if the heap does not contain any elements.

Public

numberOfItems

Number of items in the tree.

Public

## Public Static Variables

D

Number of children of each node in the tree.

Public
Static

GrowthFactor

The tree will grow by at least this factor every time it is expanded.

Public
Static

NotInHeap

Public
Static

SortGScores

Sort nodes by G score if there is a tie when comparing the F score.

Public
Static

## Private/Protected Members

heap

Internal backing array for the heap.

Private