Finds the Betweeness Centrality Score of nodes in both undirected as well as directed networks. The Betweeness Score is Calculated as the number of shortest paths passing through a particular node in the network. The algorithm is implemented with Spark Dataframes.
-
Notifications
You must be signed in to change notification settings - Fork 0
Finds the Betweeness Centrality Score of nodes in both undirected as well as directed networks. The Betweeness Score is Calculated as the number of shortest paths passing through a particular node in the network. The algorithm is implemented with Spark Dataframes.
kalikho/Betweeness-Centrality-Spark
About
Finds the Betweeness Centrality Score of nodes in both undirected as well as directed networks. The Betweeness Score is Calculated as the number of shortest paths passing through a particular node in the network. The algorithm is implemented with Spark Dataframes.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published