On Tue, May 22, 2012 at 9:01 AM, [email protected] <[email protected]> wrote: > Hi, > > I am using igraph 0.6. Now I see why it shows the same numbers in cases with > and without weight. There is only one possible path between two nodes, so > with and without weights it does not matter. Can you tell me how does > shortest path algorithm makes a decision when which route to take when > weights are included ? Any references to literature ?
I am not sure why this matters, but I think the current implementation uses Dijkstra's algorithm. Other possibilities would be the Bellman-Ford or Johnson's algorithm. But all calculate the same thing, so it does not really matter. Gabor > Thanks > > > On 21 May 2012 16:03, Gábor Csárdi <[email protected]> wrote: >> >> Well, maybe you are doing something wrong. We can only tell if you >> show us what you are doing. Also make sure that you are using the 0.6 >> version, e.g. by typing >> >> library(help=igraph) >> >> in R. >> >> Gabor >> >> > I am looking for a centrality measure which can be used for network with >> > disconnected components taking into account both weights and distances >> > (shortest paths). I think the mentioned paper is what I want, but its >> > not >> > implemented in igraph. >> > >> > Do you know how to use igraph graph object with the betweenness_w >> > function >> > from tnet package ? That would be helpful, I can't get it working. >> > >> > Thanks >> > >> > >> > On 21 May 2012 15:29, Gábor Csárdi <[email protected]> wrote: >> >> >> >> weighted shortest paths are used instead of unweighted shortest paths. >> >> >> >> Gabor >> > >> > >> > _______________________________________________ >> > igraph-help mailing list >> > [email protected] >> > https://lists.nongnu.org/mailman/listinfo/igraph-help >> > >> >> >> >> -- >> Gabor Csardi <[email protected]> MTA KFKI RMKI >> >> _______________________________________________ >> igraph-help mailing list >> [email protected] >> https://lists.nongnu.org/mailman/listinfo/igraph-help > > > > _______________________________________________ > igraph-help mailing list > [email protected] > https://lists.nongnu.org/mailman/listinfo/igraph-help > -- Gabor Csardi <[email protected]> MTA KFKI RMKI _______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
