Update

Author: IPRIT

README.md

@@ -1,3 +1,3 @@
 # @algo-js/priority-queue
 
-Fast heap-based priority queue for production
+Fastest heap-based production-ready priority queue fully written on TypeScript

package.json

@@ -1,11 +1,11 @@
 {
   "name": "@algo-js/priority-queue",
   "version": "1.0.2",
-  "description": "Fast heap-based priority queue for production",
+  "description": "Fastest heap-based production-ready priority queue fully written on TypeScript",
   "main": "build/main/index.js",
   "typings": "build/main/index.d.ts",
   "module": "build/module/index.js",
-  "repository": "https://github.com/IPRIT/algo-js/priority-queue",
+  "repository": "https://github.com/algo-js/priority-queue",
   "license": "MIT",
   "keywords": [],
   "scripts": {

src/lib/priority-queue/priority-queue.ts

@@ -65,7 +65,7 @@ export class PriorityQueue<T> extends MaxHeapTree<T> implements Queue<T> {
   /**
    * @returns {*}
    */
-  public dequeue(): T {
+  public dequeue(): T | undefined {
     const element = super.poll();
 
     if (element) {
@@ -77,13 +77,15 @@ export class PriorityQueue<T> extends MaxHeapTree<T> implements Queue<T> {
 
   /**
    * @private
+   * @deprecated
    */
   public add(element: T): this {
     throw new Error('Use `queue` method instead');
   }
 
   /**
    * @private
+   * @deprecated
    */
   public poll(): T {
     throw new Error('Use `dequeue` method instead');