Search Results for "data structures"

The package contains matricial operations, BST, double chained list, heap, queue, stack.

Aleph-w is a library of data structures and algorithms implemented in and for C++. It contains the main data structures: single and double lists, special arrays (dynamic and of bits), many types of trees: multitrees, binary search trees, avl, red-black, randomized, treaps, splay and other interesting types. Several types of hash tables are implemented: separated chaining, open adressing with linear probing and double function hash; this last one has a garbage colector mechanism...

*** THIS PROJECT HAS MOVED TO GITHUB *** https://github.com/frozen-solid/CSharp_MARC/ ********************************************************** C# MARC: C# class structures for reading and manipulating Library of Congress MARC records using the MARC21 standard. Based upon the PHP Pear package File_MARC (http://pear.php.net/package/File_MARC) by Dan Scott. C# MARC Editor: A full featured SQLite based editor for quickly modifying MARC records and exporting them to MARC21...

Alg entry is simplified by being able to choose from 21 preset algs. Or, they may be adjusted or entered from scratch. Six different "Pascalloid" output modes allow the data to be graphically explored and browsed. Help is self-contained. Now there is a way to copy data from the output into the clipboard, and to paste tab-deliniated data from the clipboard to make an algorithm.

S-Match is a semantic matching framework. S-Match takes any two tree like structures (such as database schemas, classifications, lightweight ontologies) and returns a set of correspondences between those tree nodes which semantically correspond to one another. S-Match contains implementations of the semantic matching, minimal semantic matching and structure preserving semantic matching algorithms. S-Match applies as a solution in many fields, including: information integration...

The project's purpose is to implement different types of data structures (Avl trees, Red-black trees, Binary heaps, etc.) using easy-to-read C code so it may be helpful to newbies to the world of data structure.

This project aims to be a repository of most popular data structures written in C# language, like stacks, queues, lists, linked lists, heaps, graphs, trees, etc.

.Net Generic Data Structures Provides parametric polymorphic data structores (the first is an AVL Binary tree, always balanced), for the .Net framework.

Cosmos (by OpenGenus Foundation) is your personal offline collection of every algorithm and data structure one will ever encounter and use in a lifetime. This provides solutions in various languages spanning C, C++, Java, JavaScript, Swift, Python, Go and others. This work is maintained by a community of hundreds of people and is a massive collaborative effort to bring the readily available coding knowledge offline.