Home
last modified time | relevance | path

Searched refs:oddToEven (Results 1 – 3 of 3) sorted by relevance

/dports/graphics/blender/blender-2.91.0/extern/quadriflow/3rd/lemon-1.3.1/lemon/
H A Dmatching.h1100 void oddToEven(int blossom, int tree) { in oddToEven() function
1349 oddToEven(left_path[i + 1], tree); in shrinkOnEdge()
1363 oddToEven(right_path[i + 1], tree); in shrinkOnEdge()
2557 void oddToEven(int blossom, int tree) { in oddToEven() function
2777 oddToEven(left_path[i + 1], tree); in shrinkOnEdge()
2791 oddToEven(right_path[i + 1], tree); in shrinkOnEdge()
/dports/math/lemon/lemon-1.3.1/lemon/
H A Dmatching.h1100 void oddToEven(int blossom, int tree) { in oddToEven() function
1349 oddToEven(left_path[i + 1], tree); in shrinkOnEdge()
1363 oddToEven(right_path[i + 1], tree); in shrinkOnEdge()
2557 void oddToEven(int blossom, int tree) { in oddToEven() function
2777 oddToEven(left_path[i + 1], tree); in shrinkOnEdge()
2791 oddToEven(right_path[i + 1], tree); in shrinkOnEdge()
/dports/misc/openmvg/openMVG-2.0/src/third_party/lemon/lemon/
H A Dmatching.h1100 void oddToEven(int blossom, int tree) { in oddToEven() function
1349 oddToEven(left_path[i + 1], tree); in shrinkOnEdge()
1363 oddToEven(right_path[i + 1], tree); in shrinkOnEdge()
2557 void oddToEven(int blossom, int tree) { in oddToEven() function
2777 oddToEven(left_path[i + 1], tree); in shrinkOnEdge()
2791 oddToEven(right_path[i + 1], tree); in shrinkOnEdge()