CGAL users discussion list

[Olivier Devillers <>]

400555 a écrit :
> Thank you! That what I need.
and it was in the manual.... how surprising that useful information is 
there !
> And what does it mean: complexity is O(deg(va))?
>
> deg(va) - is number of edges from vertex va ?
yes
> So the complexity is O(const) isn't it ?

no, the degree is not a constant. a vertex can have all other vertices 
as neighbors