Network diameter is defined as the length of the longest shortest path in the network. Equivalently, it measures the separation between the pair of nodes that are farthest apart when distance is taken along shortest paths.
Conditions: The network is connected enough that shortest-path distances between the compared node pairs are defined.; Distance is measured by shortest paths.
Network diameter is defined as the length of the longest shortest path in the network. Equivalently, it measures the separation between the pair of nodes that are farthest apart when distance is taken along shortest paths.
Conditions: The network is connected enough that shortest-path distances between the compared node pairs are defined.; Distance is measured by shortest paths.
In a weighted network where edges are not all considered equal, minimizing total path length does not guarantee choosing the strongest or best connection. A path can be shortest while still containing a very weak edge, making it unsuitable if the evaluation criterion includes strength or quality beyond total length.
Conditions: Edges have unequal weights or strengths.; The criterion for "best" differs from pure path-length minimization.
In a weighted network where edges are not all considered equal, minimizing total path length does not guarantee choosing the strongest or best connection. A path can be shortest while still containing a very weak edge, making it unsuitable if the evaluation criterion includes strength or quality beyond total length.
Conditions: Edges have unequal weights or strengths.; The criterion for "best" differs from pure path-length minimization.