DownloadAleph-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 that allows to free deleted entries. Dynamic linear hash tables are implemented too.
The main algorithms on graphs are implemented in an easy way and with good performance features. Network Flow (maximum and min cost), cut points, topological sort, spanning trees, min paths. etc. The graphs are generic in the sense that they can contain data independent of the algorithm.
Several containers of the C++ STL library are implemented with Aleph-w. Their performance is better than GNU implementation
Features
- Several levels of abstraction according to level programming through from hardware adapted to front-end
- Generic interfaces that allows to contain any data type without performance degradation
- Diversity of data structures and algorithms with several interface styles (function oriented and class oriented)
- Memory management independence: you decide from you allocate memory
- Many types of containers implementing the main known algorithms and data structures
- Standard C++ containers
- Full support for graphs -non directed and directed-. Almost all algorithms on graph implemented and generic
- Tested on gnu and Intel compilers