374238b7ef1c4c6df8e87b0d33bd8dce9dc71dc0

this will give some speedup but its mainly to simplify the function. - use bmesh adjacency data, was building its own data, left over from pre-bmesh. - use a flag to store visited edges rather then a hash. - store edge pointers in the heap rather then index values (was converting back and fourth a lot).
Description
No description provided
Languages
C++
78.1%
Python
15%
C
2.8%
GLSL
1.8%
CMake
1.2%
Other
0.9%