Guest Session: 1 Question Remaining. Create Account to save progress.
Login
Data Visualizationhard
0:00.0

In a network graph visualization, the 'Closeness Centrality' C(v)C(v)C(v) of a node is defined as N−1∑u≠vd(v,u)\frac{N-1}{\sum_{u \neq v} d(v, u)}∑u=v​d(v,u)N−1​. For a path graph with 5 nodes (v1−v2−v3−v4−v5v_1-v_2-v_3-v_4-v_5v1​−v2​−v3​−v4​−v5​), what is the closeness centrality of the central node v3v_3v3​?