Question

hey everybody. I need to know a fast algorithm for checking the connectivity of a undirected unit disk graph

Answer 1

Average shortest path length is a simple method for measuring the efficiency with which information can travel through a network.
\[l_G = 1/(n*(n-1))*\sum_{i,j}d(v_i,v_j)\]
where v is a vertex/node of graph G and d(v_i,v_j) is the shortest path length between nodes i and j