{"library":"priority-queue-typed","type":"library","category":null,"description":"A standalone binary heap-based priority queue with min/max modes, part of the data-structure-typed collection. Version 2.6.0 is the latest stable release, published under a weekly cadence. Ships TypeScript types and supports both ES modules and CommonJS. Differentiators include configurable comparators, heapify static method, clone, DFS traversal, and sort. Lightweight (<5 KB min+gzip) and suitable for scheduling, graph algorithms, and triage systems.","language":"javascript","status":"active","version":"2.6.0","tags":["javascript","Priority Queue","priority queue","priorityqueue","priority-queue","priority q","priorityQ","min","max","typescript"],"last_verified":"Sun Jun 07","install":[{"cmd":"npm install priority-queue-typed","imports":["import { PriorityQueue } from 'priority-queue-typed'","import { MinPriorityQueue } from 'priority-queue-typed'","import { PriorityQueue } from 'priority-queue-typed'; const maxPQ = new PriorityQueue({comparator: (a,b) => b - a})"]},{"cmd":"yarn add priority-queue-typed","imports":[]},{"cmd":"pnpm add priority-queue-typed","imports":[]}],"homepage":"https://data-structure-typed-docs.vercel.app","github":"https://github.com/zrwusa/data-structure-typed","docs":null,"changelog":null,"pypi":null,"npm":"priority-queue-typed","openapi_spec":null,"status_page":null,"smithery":null,"compatibility":null}