12 Jun
2018
12 Jun
'18
6:38 a.m.
Am 11.06.2018 um 09:37 schrieb Lietz, Haiko:
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?
I suppose. I can't think of any other reasonable definition of "largest"... -- Tiago de Paula Peixoto <tiago@skewed.de>