Given an instance of set of nodes in a social network graph, the aim is to find the influencing important users and to predict the likelihood of a future association between two nodes, knowing that there is no association between the nodes in the current state of the graph.

A graph oriented project for the generalization of the Erdos Number using dijkstra's Algorithm and Networkx.

Implementing a Graph ADT to analyze social network data from GitHub and Facebook, focusing on metrics like influence, centrality, and proximity using algorithms such as Dijkstra's