Henrique S. Xavier

While the formula for closeness centrality is correct in [Introduction_to_Networks_clean.ipynb](https://github.com/dssg/hitchhikers-guide/blob/master/sources/curriculum/2_data_exploration_and_analysis/network-analysis/Introduction_to_Networks_clean.ipynb), it is incorrect in [Introduction_to_Networks_Karate.ipynb](https://github.com/dssg/hitchhikers-guide/blob/master/sources/curriculum/2_data_exploration_and_analysis/network-analysis/Introduction_to_Networks_Karate.ipynb): a factor of *n-1* is missing on the right-hand side, where *n* is the number...

The length of the shortest path between nodes 12 and 15 in the Karate network should be: len(networkx.shortest_path(Graph_Karate, 12, 15)) - 1 because the output of `shortest_path` includes both the...