25 best open source priority queue projects.

We have collection of more than 1 Million open source products ranging from Enterprise product to small libraries in all platforms. We aggregate information from all open source repositories. Search and find the best for your needs. Check out projects section.

Displaying 1 to 20 from 25 results

Buckets-JS - A complete, fully tested and documented data structure library written in pure JavaScript

Javascript

Buckets is a complete, fully tested and documented data structure library written in pure JavaScript.

data-structures collections collection linked-list dictionary map multimap stack queue set bag binary-heap priority-queue binary-search binary-search-tree tree tree-structure buckets data structure linked list heap priority binary data-structure hashmap

javascript-datastructures-algorithms - :books: collection of JavaScript data structures and algorithms for education purposes

Javascript

Source code of Learning JavaScript Data Structures and Algorithms book.

javascript-algorithms algorithm data-structures typescript typescript-algorithms stack queue deque priority-queue linked-list set tree sorting-algorithms dictionary binary-tree avl-tree quicksort graph graph-algorithms dijkstra-algorithm

Bull - Premium package for handling jobs and messages in NodeJS

Javascript

The fastest, most reliable, Redis-based queue for Node. Carefully written for rock solid stability and atomicity.

priority-queue nodejs message-queue job-queue job queue task parallel worker-queue

Kue - Priority job queue backed by redis, built for node.js

Javascript

Kue is a priority job queue backed by redis, built for node.js.

priority-queue worker-queue job-queue job queue worker redis

High-Speed-Priority-Queue-for-C-Sharp - A C# priority queue optimized for pathfinding applications

CSharp

Yes! See the license page for more details. This project contains two priority queue implementations - one that's super-fast (without thread-safety, safety checks, etc), and one that's easy/safe to use.

c-sharp priority-queue pathfinding

SwiftPriorityQueue - A Generic Priority Queue in Pure Swift

Swift

SwiftPriorityQueue is a pure Swift (no Cocoa) implementation of a generic priority queue data structure, appropriate for use on all platforms (macOS, iOS, Linux, etc.) where Swift is supported. It features a straightforward interface and can be used with any type that implements Comparable. It utilizes comparisons between elements rather than separate numeric priorities to determine order. Internally, SwiftPriorityQueue uses a classic binary heap, resulting in O(lg n) pushes and pops. It includes in-source documentation, an A* based example maze solving program (for macOS), and unit tests (pull requests are welcome for additional unit tests in particular).

data-structure priority-queue astar-algorithm priorityqueue priority-queues min-heap max-heap

FastPriorityQueue.js - a fast heap-based priority queue in JavaScript

Javascript

Fast heap-based priority queue in JavaScript

priority-queue heap binary-heap data-structure performance

Buckets-Swift - Swift Collection Data Structures Library

Swift

Buckets is a complete, tested and documented collections library for swift.Carthage is a decentralized dependency manager that automates the process of adding frameworks to your application.

swift-3 queue deque stack priority-queue matrix multiset multimap bimap graph trie bitarray circular-buffer bloom-filter swift-package-manager carthage cocoapods

heap - Heap priority queue written in C, licensed under a BSD license

A heap abstract data type implemented within an array.Written in C with a BSD license.

heap priority-queue queue

StablePriorityQueue.js - A stable heap-based priority queue in JavaScript

Javascript

In a priority queue, you can...In practice, "quickly" often means in logarithmic time (O(log n)).

heap binary-heap data-structure priority-queue

data-structures - Go datastructures.

Copyright 2013, Licensed under the GPL version 2. Please reach out to me directly if you require another licensing option. I am willing to work with you. To collect many important data structures for usage in go programs. Golang's standard library lacks many useful and important structures. This library attempts to fill the gap. I have implemented data-structure's as I have needed them. If there is a missing structure or even just a missing (or incorrect) method open an issue, send a pull request, or send an email patch.

data-structures avl-tree avl immutable btree hashtable hash-tables linear-hash-table trie ternary-search-trie arraylist linked-list priority-queue exceptions error-handling tree

priority_queue - A JavaScript PriorityQueue

CoffeeScript

A priority queue is a handy data structure with many uses. From graph search algorithms to simple job queues, having this in your toolbelt will help to give you a solid foundation.

priority-queue coffeescript

tinyqueue - The smallest and simplest priority queue in JavaScript.

Javascript

The smallest and simplest binary heap priority queue in JavaScript. Inspired by js-priority-queue by Adam Hooper.

algorithm priority-queue binary-heap data-structure queue priority data-structures

priority-queue-dictionary - A Pythonic indexed priority queue

Python

A priority queue dictionary maps hashable objects (keys) to priority-determining values. It provides a hybrid dictionary/priority queue API. Works with Python 2.7+, 3.3+, and PyPy.

priority-queue dictionary indexed sorted-dict

priorityqueuejs - A simple priority queue data structure for Node.js and the browser

Javascript

A simple priority queue data structure for Node.js and the browser. If you just want a pre-built file for using in the web, check the releases section.

heap priority queue priority-queue data-structure

DataStructures - A collection of Data Structures implemented in Swift.

Swift

A collection of data structures implemented in Swift. All collection types are implemented as structures with the exception of the LinkedList data structure. This means they are copied when they are assigned to a new constant or variable, or when they are passed to a function or method.

datastructures swift-3 linkedlist stack queue priority-queue red-black-trees bimap bloom-filter multimap binary-heap trie avl-tree graph

AdvancedAsyncTask - Enhanced AsyncTask library for Android

Java

This library is enhanced for using AsyncTask api. Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License.

android android-library asynctask thread-priority priority-queue gradle

RxJavaPriorityScheduler - RxPS - RxJavaPriorityScheduler - A RxJava Priority Scheduler library for Android and Java applications

Java

All pull requests are welcome, make sure to follow the contribution guidelines when you submit pull request.

rxjava rxjava2 rxandroid rxandroid2 rxjava-android rxjava-library rxjava-2 android android-library mindorks priority-queue priority priority-scheduler priority-scheduling

timerqueue - A priority queue for timed events, written in go.

The timerqueue package implements a priority queue for objects scheduled to perform actions at clock times. See http://godoc.org/github.com/beevik/timerqueue for godoc-formatted API documentation.

priorityqueue timerqueue timer-queue timer scheduler priority-queue scheduling scheduling-timers

Advanced-Shortest-Paths-Algorithms - Java Code for Contraction Hierarchies Algorithm, A-Star Algorithm and Bidirectional Dijkstra Algorithm

Java

Java Code for Contraction Hierarchies Algorithm, A-Star Algorithm and Bidirectional Dijkstra Algorithm. Tested and Verified Code. Bi-Directional Dijsktra Algorithm: Bidirectional search is a graph search algorithm that finds a shortest path from an initial vertex to a goal vertex in a directed graph. It runs two simultaneous searches: one forward from the initial state, and one backward from the goal, stopping when the two meet in the middle. The reason for this approach is that in many cases it is faster.