Re: [igraph] Floyd-Warshall or other all-pairs-shortest paths in igraph?

[Gábor Csárdi]

Raj,

it was left out because nobody needed it so far. Currently we have the
following shortest path algorithms:
- breadth first search for unweighted graphs,
- Dijkstra's,
- Bellman-Ford and
- Johnson's.

Do you really specifically need Floyd-Warshall?

Best,
G.

On Wed, Jun 10, 2009 at 12:39 PM, Rajorshi Biswas<address@hidden> wrote:
> Hi,
> I'm trying out igraph for a project. While I see several shortest path
> implementations, I don't see a direct "all pairs shortest paths"
> implementation. Perhaps I'm missing something.
>
> Was this left out intentionally, or, as is more likely, what is the obvious
> thing that I'm missing :) ?
>
> If it matters, I'm using the python wrapper to igraph.
>
> Thanks in advance!
> ~Raj
>
> Raj
> http://www.rajorshi.net/blog
>
> Dear igraph-help! Get Yourself a cool, short @in.com Email ID now!
> _______________________________________________
> igraph-help mailing list
> address@hidden
> http://lists.nongnu.org/mailman/listinfo/igraph-help
>
>



-- 
Gabor Csardi <address@hidden>     UNIL DGM