Maximum Closeness Centrality -Clubs: A Study of Dock-Less Bike Sharing

Algorithm 1

Greedy Central k-Club.

1 function Greedy_Central_k-club (k);

 Input : A graph , weights

 Output: A k-club

2 ;

3 ;

4 while do

5  foralldo

6   foralldo

7    

8  end

9  ;

10  end

11 ;

12 ;

13 ;

14 end

15 return