Experimental Graph Library
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);
- It's extensible (new implementation of graph or special search cursors can be added);
It implements basic graph algorithms such as:
- Searches (depth-first, breadth-first, uniform cost, A*);
- Topological sort;
- Shortest-path (Bellman, Dijkstra, Floyd);
- Minimum Spanning Tree (Kruskal and two versions of Prim);
- Maybe some AI algorithms (like graph algorithms for constraint solving problems).
I would like to know if there is an actual interest exists for such a library and if people would be interested in commenting it as I progress.
It is not under any license yet and I'm still searching which type would best suit my needs.
I welcome every (constructive) comments.