Betweenness Centrality on Directed Graphs

[Suhas Bhairav <suhasbhairav AT gmail.com>]

Hi,

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?

Link : http://graphstream-project.org/doc/Algorithms/Betweenness-Centrality/

Regards

Suhas Bhairav