pub fn eccentricity(graph: &Graph) -> IgraphResult<Vec<u32>>Expand description
Eccentricity of every vertex (length vcount). Result r[v] is the
maximum shortest-path distance from v to any reachable vertex.
Isolated vertices have eccentricity 0.
Counterpart of igraph_eccentricity(_, NULL_weights, _, igraph_vss_all(), IGRAPH_OUT).