Eccentricity
Eccentricity[g]
gives the eccentricity of each vertex 
of graph g, the maximum length among all shortest paths from 
.
Combinatorica`
Combinatorica`
Eccentricity
As of Version 10, most of the functionality of the Combinatorica package is built into the Wolfram System. »
Eccentricity[g]
gives the eccentricity of each vertex 
of graph g, the maximum length among all shortest paths from 
.
更多信息和选项
- Eccentricity functionality is now available in the built-in Wolfram Language function VertexEccentricity.
- To use Eccentricity, you first need to load the Combinatorica Package using Needs["Combinatorica`"].
范例
基本范例 (2)
Eccentricity has been superseded by VertexEccentricity:
Wolfram Research (2007)，Eccentricity，Wolfram 语言函数，https://reference.wolfram.com/language/Combinatorica/ref/Eccentricity.html.
文本
Wolfram Research (2007)，Eccentricity，Wolfram 语言函数，https://reference.wolfram.com/language/Combinatorica/ref/Eccentricity.html.
CMS
Wolfram 语言. 2007. "Eccentricity." Wolfram 语言与系统参考资料中心. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/Eccentricity.html.
APA
Wolfram 语言. (2007). Eccentricity. Wolfram 语言与系统参考资料中心. 追溯自 https://reference.wolfram.com/language/Combinatorica/ref/Eccentricity.html 年