赋权有向图中心问题

问题描述:



设G=(V,E)是一个赋权有向图，v是G的一个顶点，



v的偏心距定义为：



Max {w∈ V,从w到v的最短路径长度}



G中偏心距最小的顶点称为G的中心。试利用Floyd



算法设计一个求赋权有向图中心的算法。-Empowering the central issue Digraph Problem Descr iption: Let G = (V, E) is a directed graph Empowering, v is a G vertex, v is defined as the eccentricity: Max (w ∈ V, from w to v the shortest path length) G the minimum eccentricity of the vertex as the center of G. Try using Floyd algorithm for the design of a plan to empower the center to the algorithm.