{"library":"updatable-priority-queue","type":"library","category":null,"description":"A generic priority queue implementation based on a binary heap with an efficient updateKey operation, version 0.0.1. Release cadence is currently unknown as it's a new package. Key differentiator vs other priority queues: it supports updating the key of an element after insertion, which is essential for algorithms like Dijkstra's or A* pathfinding where priorities change incrementally. Built primarily for the jKstra graph library but generally useful.","language":"javascript","status":"active","version":"0.0.1","tags":["javascript","priority","queue","binary","heap"],"last_verified":"Sun Jun 07","install":[{"cmd":"npm install updatable-priority-queue","imports":["import PriorityQueue from 'updatable-priority-queue'","import PriorityQueue from 'updatable-priority-queue'","import type PriorityQueue from 'updatable-priority-queue'"]},{"cmd":"yarn add updatable-priority-queue","imports":[]},{"cmd":"pnpm add updatable-priority-queue","imports":[]}],"homepage":"https://github.com/bbecquet/updatable-priority-queue#readme","github":"https://github.com/bbecquet/updatable-priority-queue","docs":null,"changelog":null,"pypi":null,"npm":"updatable-priority-queue","openapi_spec":null,"status_page":null,"smithery":null,"compatibility":null}