eccentricity(G, v=None, sp=None)

The eccentricity of a node v is the maximum distance from v to all other nodes in G.

Parameters

G : NetworkX graph

A graph

v : node, optional

Return value of specified node

sp : dict of dicts, optional

All pairs shortest path lengths as a dictionary of dictionaries

Returns

ecc : dictionary

A dictionary of eccentricity values keyed by node.

Returns the eccentricity of nodes in G.

Examples

>>> G = nx.Graph([(1, 2), (1, 3), (1, 4), (3, 4), (3, 5), (4, 5)])
... dict(nx.eccentricity(G))
{1: 2, 2: 3, 3: 2, 4: 2, 5: 3}

>>> dict(nx.eccentricity(G, v=[1, 5]))  # This returns the eccentrity of node 1 & 5
{1: 2, 5: 3}

See :

Back References

The following pages refer to to this document either explicitly or contain code examples using this.

networkx.algorithms.distance_measures.eccentricity networkx.algorithms.distance_measures.diameter

Local connectivity graph

Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.

Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)

SVG is more flexible but power hungry; and does not scale well to 50 + nodes.

All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them

---

GitHub : /networkx/algorithms/distance_measures.py#286
type: <class 'function'>
Commit: