Coursera's Data Structures and Algorithms Specialization
A Pythonic indexed priority queue
🚀 Kew - A Fast, Redis-backed Task Queue Manager for Python
A simple POC app on Django framework
My solutions to Leetcode problems
warnsdorff's algorithm to solve the knight's tour problem.
Bidirectional k-shortest paths with DP
🔗100 algorithms for 100 days. Can I do it?
Performance Comparison of Prim's Algorithm using Different Priority Queues
Python project applies Dijkstra's algorithm for shortest maze pathfinding with visualization capabilities
strict order sharded job queue
🌲 XML and Drawing, Arrays, Hashing, Sets, Maps, Recursion, Sudoku Solver, Graphs, Dijkstras, PriorityQueue, Heaps, Kruskals, Bloom Filter, Trie, AVL Tree, BTree 🐍
A* implementation with open street maps data to compute shortest path on maps with kd-tree and mean of means algorithm.
A python based visualizer for A* pathfinding algorithm.
NeoTask | Python 轻量级分布式异步任务调度库 · 零依赖 · 优先级/延时/Cron · SQLite/Redis 后端/高可用 · Celery 轻量替代方案 （Zero‑dependency async task queue for Python. Built‑in priority, cron, retry. SQLite/Redis backend. Lightweight alternative to Celery.）
A desktop application to simulate lift control with a custom algorithm optimised to reduce distance travelled by the lift by 82.5%. Developed with Qt.
All LeetCode Problems Charry Solved
Adapting the Dijkstra's algorithm to find the longest path instead of the shortest
Fast addressable priority queues for Python implementing advanced operations
Add a description, image, and links to the priority-queue topic page so that developers can more easily learn about it.
To associate your repository with the priority-queue topic, visit your repo's landing page and select "manage topics."