DataStructures for graphs, vertices,edges,nodes and trees.
Contains a Binary Search Tree, AVL Tree and a PriorityQueue based on BST Tree which can handle duplicates
Fully managed library providing five types of heap. It implements d-ary, binary, binomial, Fibonacci and pairing heaps, in order to let the user choose the best heap to fit her/his needs. Each heap has its own advantages and disadvantages: please see the documentation or Wikipedia to better...
More information
