Floyd Warshall Algorithm

Topics: algorithm, graph
May 23, 2013 at 10:40 AM
I've just started with the QuickGraph library, and am hoping to make use of the Floyd Warshall algorithm in order to find the distances between all vertices within a set of vertices. However, it seems that the algorithm currently takes all vertices in a graph into account, whereas I only want to select amongst a subset.

For example, if I have a graph of 1000 vertices - I might want to know the distances between 10 of these, rather than between every single vertex. Is this possible at the moment?

Feb 12, 2014 at 5:10 PM
I have the same question, did you happen to find a way to do this?