Give you a graph G of n points, numbered 1-n. We define the Geosetic set of two points as Geodetic(x,y), representing the set of points on all the shortest path from point x to point y. Each point has a weight wi, we define the sum of the points in Geodetic corresponding to wi as U(x,y) We guarantee that there is no self-loop and there is at most one edge between two points. For example Geodetic(2,5)={2,3,4,5} Geodetic(1,5)={1,3,5} U(2,5)=6+2+7+4=19 U(1,5)=1+2+4=7
Give you a graph G of n points, numbered 1-n. We define the Geosetic set of two points as Geodetic(x,y), representing the set of points on all the shortest path from point x to point y. Each point has a weight wi, we define the sum of the points in Geodetic (x, y) corresponding to wi as U(x,y) We guarantee that there is no self-loop and there is at most one edge between two points. For example Geodetic(2,5)={2,3,4,5} Geodetic(1,5)={1,3,5} U(2,5)=6+2+7+4=19 U(1,5)=1+2+4=7
（图片来源网络，侵删）
