Refactor value checks for unweighted graphs.
Add Pays de la Loire test in comments.
Add timing for each node in comments.
Merge branch 'master' into unweightedAnalyzer
Major code refactor: Split up algo, 3 main parts.

I split up Brandes' algorithm into 3 main parts:
1. Calculate all the shortest paths from startNode.
2. Calculate closeness for startNode.
3. Accumulate dependencies.

In order to adapt this algorithm to weighted graphs, it should
suffice to replace the BFS search used to accomplish (1) by
another search algorithm such as Dijkstra or A*.

For this reason, I am considering moving most of the methods
found in UnweightedGraphAnalyzer up to its parent GraphAnalyzer.