Projects tagged ‘algorithms’ and ‘datastructures’

A class library providing generic data structures and algorithms not implemented in the standard .NET framework. The library plays around in the following broad classes : - Any data structure ... [More] (general, mathematical, trees, queues, etc.) - Sorting algorithms - Algorithms performed on data structures (Djikstra's shortest path algorithm, for example). [Less]

The TPIE (Templated Portable I/O Environment) library is a tool box providing efficient and convenient tools to ease the implementation of algorithm and data structures on very large sets of data.

Useful common data structures and algorithms

source code for a blog about algorithms

Практические занятия по курсу "Структуры и алгоритмы компьютерной обработки данных" Содержание

Data Structures, etc,

This project provides a generic implementation for commonly used data structures and algorithms. Most of them are in C. Some are in C++. Look through sample implementations before using. I have tried ... [More] to include sample usages along with the code (in some cases in the same file or as a separate program) Currently the library features the following implementations: - DATA STRUCTURES C implementations Hash Table Balanced binary search trees: - (1) AVL tree (2) Red-black tree (3) Splay tree Priority queue (1) Fibonacci Heaps Union-Find data structure List Vector Memory Manager C++ implementations Radix tree Suffix tree Tuple Smart pointer ALGORITHMS Selection algorithm (linear time median finding) [Less]

Coelacanth is a C generic programming library

C++ projects to implement miscellaneous data structures (e.g. AVL tree, Red-Black tree, hash map, etc) in educational and self educational purposes.

The Soft Heap data structure is the backbone of the (theoretically) fastest minimum spanning tree algorithm known. It can also be used to implement selection, median finding, and to do approximate ... [More] sorting. This project attempts to provide good implementations of the Soft Heap so that such algorithms can be benchmarked. [Less]