Weighted undirected graphs

[Eric]

Hi,

I have few questions that I hope you can help me with:

1. Should there be put a threshold on weighted graphs? Some studies have done that while other use the weights (connectivity values) directly.

2. When calculating path length and clustering coefficient in undirected weighted networks there seems to be a strong inverse correlation between the two if no threshold has been applied. Is this true?

3. I haven’t been able to find this out: Is there any reasons for using Dijkstra algorithm or Floyd–Warshall algorithm when calculating average path length in undirected weighted networks?

Thanks a lot in advance,

Eric

[Author]

Posts