Re: [Boost-users] Boost Graphs - Betweenness Centrality

Subject: Re: [Boost-users] Boost Graphs - Betweenness Centrality
From: Rupert Ogilvie (rogilvie_at_[hidden])
Date: 2010-09-28 11:16:22

Hi Jeremiah,
Many thanks for the pointer, those gave me exactly what I needed!
Cheers,
Rupert

-----Original Message-----
From: boost-users-bounces_at_[hidden]
[mailto:boost-users-bounces_at_[hidden]] On Behalf Of Jeremiah
Willcock
Sent: 27 September 2010 20:39
To: boost-users_at_[hidden]
Subject: Re: [Boost-users] Boost Graphs - Betweenness Centrality

On Mon, 27 Sep 2010, Rupert Ogilvie wrote:

>
> Hi all,
>
> I’m trying to implement the Betweenness Centrality Calculation in the
> Boost Graph Library. I’ve created a graph with the following attributes:
>
>
>
> typedef adjacency_list <vecS, vecS, undirectedS> Graph;
>
> Graph G1;
>
>
>
> But I’m struggling to get the Done object created right to pass into
> the calculation. If anyone has some example code or suggestions I’d be
> really grateful.
>
> Apologies if this is a really basic question but I’m very new to C++
> and Boost!

Which betweenness centrality algorithm are you using?  Brandes' algorithm
(http://www.boost.org/doc/libs/1_44_0/libs/graph/doc/betweenness_centralit
y.html)
does not seem to require a Done object.  There is an example program for
that algorithm in libs/graph/test/betweenness_centrality_test.cpp in the
Boost source tree.  Or do you mean betweenness_centrality_clustering?  An
example for it (including a correct Done object) is in
libs/graph/example/actor_clustering.cpp in the Boost source tree.

-- Jeremiah Willcock