Displaying 1 to 9 from 9 results

gods - GoDS (Go Data Structures)

  •    Go

Implementation of various data structures and algorithms in Go.Containers are either ordered or unordered. All ordered containers provide stateful iterators and some of them allow enumerable functions.

geo-tree - High performance library for geographical map-related operations

  •    Javascript

Geo-tree library is a tool for working with map objects. The primary use-case is creating a set of map-related objects (i.e. each of them having its latitude, longitude and data), followed with a queries to find objects in given area (exact match / rectangular area / circle area). The existing code we used for this purpose originally (that was part of (one of the many available) google map directives) was not performant enough (it scanned the whole set of objects sequentially each time), so our goal was to speed the find queries using some clever data structures and algorithms.

leafy - a library of different tree implementations that can be used in both the browser and node

  •    Javascript

leafy is a library of different tree implementations. leafy can be used in both the browser and node. Why would I need a tree in javascript? I have arrays and objects.

ygg - An intrusive C++14 implementation of a Red-Black-Tree, an Interval Tree and an Interval Map.

  •    C++

If you're not sure whether one of these data structures is the right data structure for your application, check out the datastructure overview in the Documentation. Warning: This is still in development. Therefore, things could break. Also, the API might change. If you found an example where one of the data structures does not behave as expected, please let me know.

sweepline - Fortune's algorithm for Voronoi diagram generating on the plane

  •    C++

Fortune's algorithm for Voronoi diagram generating on the plane. Intended for runtime speed and careful handling of corner cases.

js_bintrees - Javascript implementation of binary search trees

  •    Javascript

This package provides Binary and Red-Black Search Trees written in Javascript. It is released under the MIT License. Binary Search Trees are a good way to store data in sorted order. A Red-Black tree is a variation of a Binary Tree that balances itself.

data-structures - Fast, light and hassle-free JavaScript data structures, written in CoffeeScript.

  •    Javascript

Fast, light and hassle-free JavaScript data structures, written in CoffeeScript. Alternatively, you can directly use the compiled JavaScript version in the "distribution" folder. It's always in sync with the CoffeeScript one.

collectable - High-performance immutable data structures for modern JavaScript and TypeScript applications

  •    TypeScript

Note: This library is an ongoing work in progress. The data structures mentioned below are all working nicely, but will probably have additional methods introduced as time goes on, and there may be some breaking changes in future versions when work commences to iron out API inconsistencies between data structures. Documentation is also somewhat lacking and out of date, but take a look at the functions folder for each data structure package, which is almost as good as actual documentation, due to the one-operation-per-file policy, and the comprehensive TypeScript annotations. See the road map for information on further development and plans for additional features and data structures.

Advanced-Algorithms - 100+ algorithms & data structures generically implemented in C#.

  •    CSharp

Please don't take effort to create pull requests for new algorithms/data structures. This is just a curiosity driven personal hobby and was originally not intented to be a library. Feel free fork and modify to fit your need if that's what you are looking for. You can however open issues/fix bugs with pull requests here, I would be happy to take a look when I get time. Various important computer science algorithms generically implemented in C#.