> But imagine a graph consisting of a 4-clique and a 5-ring overlapping in one > node: > > ... > > In this case your proposed method to extract the vertices with edges labeled > the most frequent number doesn't work. Is there a universal recipe?
I mean, I can check the size of each bicomponent and then pick the largest one. I guess that's the universal recipe? Haiko _______________________________________________ graph-tool mailing list graph-tool@skewed.de https://lists.skewed.de/mailman/listinfo/graph-tool
