Search code examples
c++graph-theoryboost-graph

Other Centrailty Measures in the Boost Graph Libary


I was wondering if any one else knows of other ways to measure the importance of certain nodes in a graph in general and in the boost graph library.

These are the ones I already have.

  • Degree centrality
  • closeness centrality
  • mean path length
  • clustering coefficient

Thanks.


Solution

  • There are other measures of Centrality. The most obvious ones you are missing are Betweenness and Eigenvector centrality which are explained on the Wiki page.

    Boost does Betweenness but not Eigenvector centrality. You may have to convert the graph to a matrix and use something like Eigen which is also header only.