Re: [graph-tool] [announcement] New version from graph-tool

Hi Claudio Claudio Martella wrote:

This sounds like a great news, i wasn't expecting this news so early. Just one question: i see that most of the most important algorithms (at least for me) are already there. What about shortest paths (Dijkstra and Floyd-Warshall i.e.)? Is it missing in the doc or you plan them for the future?

Shortest paths is still not there, since I wanted to make it configurable, with the "visitor" approach from the BGL reflected in graph-tool. But I decided to make a release without it, otherwise I will keep indefinitely including things. It is definitely on the list.

Congratulations again for your great work.

Thanks! Cheers, Tiago