On Mon, Oct 5, 2009 at 7:35 PM, Tiago de Paula Peixoto <ti...@forked.de> wrote: > 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.
I perfectly understand your decision. I have a question on this issue. I see that the distance_histogram basically calculates all-pairs shortest paths (ASSP) as it returns all the shortest distances. So some sort of ASSP is already implemented. Is it possible to access it already? Do you have any workaround suggestion for me? >> Congratulations again for your great work. > > Thanks! > > Cheers, > Tiago > > > _______________________________________________ > graph-tool mailing list > graph-tool@forked.de > http://lists.forked.de/mailman/listinfo/graph-tool > > -- Claudio Martella claudio.marte...@gmail.com _______________________________________________ graph-tool mailing list graph-tool@forked.de http://lists.forked.de/mailman/listinfo/graph-tool
