You are given a weighted undirected graph consisting of n vertices and m edges ($$$1 \leq n, m \leq 10^5$$$). Let $$$d(u, v)$$$ be the shortest distance between $$$u$$$ and $$$v$$$. What is the best algorithm to calculate $$$\sum_{1 \leq u < v \leq n} d(u, v)$$$?
Auto comment: topic has been updated by Minh639 (previous revision, new revision, compare).
https://www.youtube.com/watch?v=X05j49pc6DE
learn this