Re: [Boost-users] [BGL] Threshold for betweenness_centrality_clustering()

Subject: Re: [Boost-users] [BGL] Threshold for betweenness_centrality_clustering()
From: Jeremiah Willcock (jewillco_at_[hidden])
Date: 2011-01-20 13:36:05

On Thu, 20 Jan 2011, Cedric Laczny wrote:

> Hi,
>
> I would like to use boost::betweenness_centrality_clustering() to search a
> graph for specific clusters. The documentation talks about a "Done" object,
> which I assume is a functor, similar to the predicates used in
> filtered_graph().
> So in order to decide whether the algorithm should stop the clustering, it
> probably needs a threshold to decide if it should further iterate and remove
> edges to decompose the graph.
>
> My questions now are:
> - Does someone perhaps have an example for the usage of this algorithm? I
> only found documentation on "betweenness.centrality.clustering {RBGL}" for Gnu
> R, which doesn't bring me very far.
> - Is there some sort of rule-of-thumb to start with for finding this
> termination threshold or if there is some more-or-less methodical way of
> finding out a reasonable threshold?

I do not know too much about the algorithm myself, but would the 
documentation at 
<URL:http://www.boost.org/doc/libs/1_45_0/libs/graph/doc/bc_clustering.html> 
help you?

-- Jeremiah Willcock