gives the length of the longest shortest path from the source s to every other vertex in the graph g.
- VertexEccentricity[g,s] gives the vertex eccentricity for the connected component in which s is contained.
- The following options can be given:
- Possible Method settings include "BellmanFord" and "Dijkstra".
Basic Examples (1)
Find the vertex eccentricity of vertex 1 in a graph:
Properties & Relations (3)
Introduced in 2010
Updated in 2015