WLJS LogoWLJS Notebook

VertexEccentricity

VertexEccentricity[g, s] gives the length of the longest shortest path from the source s to every other vertex in the graph g.

  • VertexEccentricity[{v -> w, ...}, ...] uses rules v -> w to specify the graph g.

Examples

g = CompleteGraph[5];
VertexEccentricity[g, 1]

Please visit the official Wolfram Language Reference for more details.

On this page