Re: [igraph] Floyd-Warshall
Hello, you can apply the floyd function from the Rfast package to the adjacency matrix. library(igraph) library(Rfast) mAdj = as_adjacency_matrix(g) mAdj = as.matrix(mAdj)mAdj[mAdj==0] = Inf mNeigh = floyd(mAdj)mNeigh[mNeigh==Inf] = 0 Milo On Friday, 23 August 2019, 12:29:22 CEST, 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 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/listinfo/igraph-help ___ igraph-help mailing list igraph-help@nongnu.org https://lists.nongnu.org/mailman/listinfo/igraph-help ___ igraph-help mailing list igraph-help@nongnu.org https://lists.nongnu.org/mailman/listinfo/igraph-help
Re: [igraph] Floyd-Warshall
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, 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/listinfo/igraph-help ___ igraph-help mailing list igraph-help@nongnu.org https://lists.nongnu.org/mailman/listinfo/igraph-help
Re: [igraph] Floyd-Warshall
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/listinfo/igraph-help ___ igraph-help mailing list igraph-help@nongnu.org https://lists.nongnu.org/mailman/listinfo/igraph-help
Re: [igraph] Floyd-Warshall
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 here: https://igraph.org/c/doc/igraph-Structural.html#idm231921766032 > > ___ > igraph-help mailing list > igraph-help@nongnu.org > https://lists.nongnu.org/mailman/listinfo/igraph-help > ___ igraph-help mailing list igraph-help@nongnu.org https://lists.nongnu.org/mailman/listinfo/igraph-help
[igraph] Floyd-Warshall
Hi igraph doesn't implement Floyd-Warshall algorithm? ___ igraph-help mailing list igraph-help@nongnu.org https://lists.nongnu.org/mailman/listinfo/igraph-help