A graph oriented project for the generalization of the Erdos Number using dijkstra's Algorithm and Networkx.
-
Updated
Dec 22, 2017 - Python
A graph oriented project for the generalization of the Erdos Number using dijkstra's Algorithm and Networkx.
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.
Add a description, image, and links to the closeness-centrality topic page so that developers can more easily learn about it.
To associate your repository with the closeness-centrality topic, visit your repo's landing page and select "manage topics."