[Eeglablist] Dijkstra vs Floyd–Warshall in undirected weighted networks

[Eric HG]

Hi everyone,

Does anyone know if there are any fundamental reasons for using Dijkstra
algorithm or Floyd–Warshall algorithm when calculating average path length
in undirected weighted networks?

>From what I can find it seems that for Floyd–Warshall algorithm there seems
to be a very close inverse correlation with the clustering coefficient. Is
this true?

Best,

Eric
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://sccn.ucsd.edu/pipermail/eeglablist/attachments/20171128/0e135ea1/attachment.html>