@graphty/algorithms
Version:
Graph algorithms library for browser environments implemented in TypeScript
21 lines • 545 B
TypeScript
/**
* Min Priority Queue implementation for graph algorithms
*/
export declare class MinPriorityQueue<T> {
private heap;
private compare;
constructor(compareFunction?: (a: T, b: T) => number);
private defaultCompare;
private parent;
private leftChild;
private rightChild;
private swap;
private heapifyUp;
private heapifyDown;
insert(value: T): void;
extractMin(): T | undefined;
peek(): T | undefined;
isEmpty(): boolean;
size(): number;
}
//# sourceMappingURL=priorityQueue.d.ts.map