Class

packages/graph/src/Steps.ts:4974–4974

 * Used in Dijkstra's algorithm to achieve O((V + E) log V) complexity.
 */
class MinHeap<T> {
  private heap: T[] = [];
  private compareFn: (a: T, b: T) => number;