Calculate Various Centrality using Boost Library

Question

I am new to C++. Is there any way of calculating the Closeness Centrality, Betweenness Centrality and Degree Centrality of a graph using the Boost graph library?

Answer 1

As far as I know Boost Graph Library only does Betweenness (part of Graph Metrics):

[the algorithm] can operate either on weighted graphs (if a suitable edge weight map is supplied) or unweighted graphs (if no edge weight map is supplied). The result is the absolute betweenness centrality;

See How to calculate betweenness using boostlib for adjacency list? and Yet another BGL's Betweenness centrality issue for examples.