Extract largest biconnected component

graph-tool
#1

Hi all,

There is a function to label the edges of biconnected components in a graph:

https://graph-tool.skewed.de/static/doc/topology.html#graph_tool.topology.label_biconnected_components

I'm struggling to interpret the output of the example given there. comp.a is an edge property map with integers labeling edges. But what are those values?

And how can I use this property map to extract the *largest* bicomponent?

Is it about binarizing the map and using it in G.set_edge_filter()?

Many thanks in advance, list

Haiko

Dr. Haiko Lietz
GESIS - Leibniz Institute for the Social Sciences
Department of Computational Social Science
Unter Sachsenhausen 6-8, 50667 Köln, Germany
Tel: + 49 (0)221 / 47694 - 223
eMail: haiko.lietz(a)gesis.org<mailto:haiko.lietz(a)gesis.org>
Web: http://www.gesis.org/&gt;

attachment.html (4.58 KB)

#2

I’m struggling to interpret the output of the example given there. comp.a is
an edge property map with integers labeling edges. But what are those values?

They are the biconnected component labels, as the documentation says.

And how can I use this property map to extract the **largest** bicomponent?

Just look at the label that occurs most often.

Best,
Tiago