ALEPH-w
Data structures and Algorithms library
... 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