Why might the shortest path not be the best path in a weighted network?
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.
Reasoning, step by step
- Recognize that weighting makes edge quality matter beyond mere count or length.
- Note that the highlighted shortest route may contain a very weak edge.
- Conclude that shortest does not imply best under this alternative criterion.
Example
The speaker warns that in a weighted network, the shortest path may not be the strongest or best path since it may involve a very weak edge.
Common misconceptions
- Equating shortest with best in weighted networks; assuming that the path with minimum total length is automatically the strongest or best connection.
Watch the explanation
Explore next
Answers are generated from source material and independently checked. Consult the original video or creator if something is unclear.