VertexEccentricity[g, s] 给出在图 g 中从源顶点 s 到每个其它顶点的最长最短路径的长度.
求一个图中顶点1的顶点离心率：
GraphRadius GraphDiameter GraphCenter GraphPeriphery GraphDistanceMatrix
400+ new features, including the new Wolfram Predictive Interface, social network analysis, enterprise CDF deployment, and more »
