Computing Top-K Closeness Centrality In Unweighted Undirected Graphs Revisited