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
- Building the graphs
- Overall informations of a graph
- Centrality measures (Beetweenness, Degree Centrality, Closeness, Page Rank)
- Shortest paths (Djikstra)
- 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: