I'm currently building an experimental library to deal with graphs. Its main features are:

• It's general;
• It provides a flexible adjacency list implementation for both directed and non-directed graphs;
• The specifications of the classes are precise (they expressed as mathematical models using the EiffelSpec library);