Hello. I have to admit I may have been a bit vague. I agree with you on the fact that datastructures are some kind of graph. I would even say they are a particular case of a more general graph (e.g. lists, trees ...)
I am simply searching for a more elaborate one including common graph algorithms, properties support on nodes and edges, linked list versus sparse memory storage ... (intsets) + some APIs for querying/updating ... Pascal
