ToDo List

[DJuego]

This project seems very promising. Thank you for your efforts!

I want to ask you if you have any plan or schedule. The graph theory is rich and huge! What is your approach? Will it be a minimal library? Or do you aspire to implement a collection of algorithms?

For instance; In the classical Shortest Path problem we have Bellman–Ford algorithm, Floyd Warshall algorithm, Johnson’s algorithm.. etc.

This link is fascinating.

I would like some day to have the exercises/practices of this website resolved with your library. For example, this :-P. They might be useful as examples or automated test cases.

DJuego

PS:
My main interest is high performance and a clean and elegant design (Yes. I know that sometimes they are irreconcilable.)

Sorry for my English.

Edit: links fixed

[cbbowen]

The scope of the project is rather amorphous at the moment, but I would like to see it become a general-purpose graph library while maintaining a clean external interface. Basically, I won't consider it complete as long as there is still interest in adding new data structures and algorithms.

My particular areas of expertise are in motion planning and machine learning, so I have focused my efforts so far on features useful in this domain, but if there is a particular algorithm you need, feel free to create an issue. For someone already familiar with C++, I do believe this library would be a good starting point for learning to implement the algorithms you linked, and hopefully they would then contribute their work.