Graph Analysis From Scratch

Goal

In this notebook we wanted to implement some functionalities to analyze a weighted graph only by using algorithms implemented from scratch. In the functionalities are also embedded plots to visualize the results.

Overwiev

1. Building the graphs
2. Overall informations of a graph
3. Centrality measures (Beetweenness, Degree Centrality, Closeness, Page Rank)
4. Shortest paths (Djikstra)
5. Cutting a graph (BFS, DFS, Ford-Fulkersson)

Content

• graphAnalysis.ipynb is the main notebook
• functions.py contains all the functions to analyze the graph and plot the results

Resources

All the necessary data can be found at the following link:

• https://www.dropbox.com/sh/auwn7v141dajsuj/AAAG1Y1CvxCOpEMSnAFBECWCa?dl=0