Before revision:  As in Cabello's work, our algorithm can also computethe Wiener index of a planar graph (i.e., the sum of all pairwise distances)  within the same bound .
After revision:  As in Cabello's work, our algorithm can also computethe Wiener index of a planar graph (i.e., the eccentricity of v), and the sum of distances from v to all other vertices. Hence, our algorithm can also compute the radius, median, and Wiener index (sum of all pairwise distances) within the same bound .