Centrality to find the initial k spots

[JunoJin]

The overall goal is to use centrality algorithms to find the k most central nodes of a network, but these k nodes must be reasonably 'spaced out' apart from each other to be valid.

The plan is to cluster the network into k clusters and then run a closeness centrality algorithm on each node in the cluster. This may change depending on how it performs.

[JunoJin]

The plan:

• [x] filter by giant component

• [x] Run modularity to get k large communities

• [x] Filter to view each community and run centrality algorithms on it.

• [x] Return the nodes with the highest centrality form each of the k communities

[JunoJin]

• [x] The algorithm should only return residential nodes (should it run modularity/centrality algorithms solely on the residential nodes @i-am-Nathan ?)

• [x] Also have extra functionality to return each community as a List to visualize each community in relation to the central nodes

[JunoJin]

This is finally 100% completed ending with commit f6cea72ba3a1f77a48efb53a95721e752e5ec957