GraphStream Users

Archives de la liste Aide

Betweenness Centrality on Directed Graphs

Chronologique Discussions 
  • From: Suhas Bhairav <suhasbhairav AT>
  • To: users AT, dev AT
  • Subject: Betweenness Centrality on Directed Graphs
  • Date: Thu, 16 Jun 2016 11:04:49 +0200


In the documentation related to Betweenness Centrality computation it has been mentioned "This algorithm does not take into account edge direction yet" under the "Usage" section . So does that mean a directed graph is treated as an undirected graph during the  calculation of betweenness centrality value of each node?

If this is the case, we would be probably have to implement our own version of Betweenness Centrality calculation on a directed graph while calculating centrality of each node. Is my understanding correct?

Suhas Bhairav

Archives gérées par MHonArc 2.6.16.

Top of page