Re: [igraph] Floyd-Warshall

2019-08-25 Thread Monnier Milo via igraph-help
, elastica--- via igraph-help wrote: Thank-you for your prompt reply. - Mail original - De: "Tamás Nepusz" À: "Help for igraph users" Cc: elast...@laposte.net Envoyé: Vendredi 23 Août 2019 11:15:17 Objet: Re: [igraph] Floyd-Warshall No, it doesn’t. T. > On

Re: [igraph] Floyd-Warshall

2019-08-23 Thread elastica--- via igraph-help
Thank-you for your prompt reply. - Mail original - De: "Tamás Nepusz" À: "Help for igraph users" Cc: elast...@laposte.net Envoyé: Vendredi 23 Août 2019 11:15:17 Objet: Re: [igraph] Floyd-Warshall No, it doesn’t. T. > On 2019. Aug 23., at 10:58, elas

Re: [igraph] Floyd-Warshall

2019-08-23 Thread Tamás Nepusz
No, it doesn’t. T. > On 2019. Aug 23., at 10:58, elastica--- via igraph-help > wrote: > > Hi > > igraph doesn't implement Floyd-Warshall algorithm? > > ___ > igraph-help mailing list > igraph-help@nongnu.org > https://lists.nongnu.org/mailman/list

Re: [igraph] Floyd-Warshall

2019-08-23 Thread Szabolcs Horvát
On Fri, 23 Aug 2019 at 10:59, elastica--- via igraph-help < igraph-help@nongnu.org> wrote: > Hi > > igraph doesn't implement Floyd-Warshall algorithm? > It implements the Bellman-Ford and Johnson algorithms, which can be used for shortest path finding in graphs with negative edge weights. See he

[igraph] Floyd-Warshall

2019-08-23 Thread elastica--- via igraph-help
Hi igraph doesn't implement Floyd-Warshall algorithm? ___ igraph-help mailing list igraph-help@nongnu.org https://lists.nongnu.org/mailman/listinfo/igraph-help