| /dports/graphics/blender/blender-2.91.0/extern/quadriflow/3rd/lemon-1.3.1/lemon/ |
| H A D | fractional_matching.h | 847 void evenToMatched(Node node, int tree) { in evenToMatched() function
927 evenToMatched(even, tree); in alternatePath()
940 evenToMatched(even, tree); in alternatePath()
948 evenToMatched(n, tree); in destroyTree()
1088 evenToMatched(left_path[i], tree); in cycleOnEdge()
1098 evenToMatched(right_path[i], tree); in cycleOnEdge()
1683 evenToMatched(even, tree); in alternatePath()
1696 evenToMatched(even, tree); in alternatePath()
1704 evenToMatched(n, tree); in destroyTree()
1833 evenToMatched(left_path[i], tree); in cycleOnEdge()
[all …]
|
| H A D | matching.h | 992 void evenToMatched(int blossom, int tree) { in evenToMatched() function
1171 evenToMatched(even, tree); in alternatePath()
1182 evenToMatched(even, tree); in alternatePath()
1193 evenToMatched(b, tree); in destroyTree()
2451 void evenToMatched(int blossom, int tree) { in evenToMatched() function
2626 evenToMatched(even, tree); in alternatePath()
2637 evenToMatched(even, tree); in alternatePath()
2648 evenToMatched(b, tree); in destroyTree()
|
| /dports/math/lemon/lemon-1.3.1/lemon/ |
| H A D | fractional_matching.h | 847 void evenToMatched(Node node, int tree) { in evenToMatched() function
927 evenToMatched(even, tree); in alternatePath()
940 evenToMatched(even, tree); in alternatePath()
948 evenToMatched(n, tree); in destroyTree()
1088 evenToMatched(left_path[i], tree); in cycleOnEdge()
1098 evenToMatched(right_path[i], tree); in cycleOnEdge()
1683 evenToMatched(even, tree); in alternatePath()
1696 evenToMatched(even, tree); in alternatePath()
1704 evenToMatched(n, tree); in destroyTree()
1833 evenToMatched(left_path[i], tree); in cycleOnEdge()
[all …]
|
| H A D | matching.h | 992 void evenToMatched(int blossom, int tree) { in evenToMatched() function
1171 evenToMatched(even, tree); in alternatePath()
1182 evenToMatched(even, tree); in alternatePath()
1193 evenToMatched(b, tree); in destroyTree()
2451 void evenToMatched(int blossom, int tree) { in evenToMatched() function
2626 evenToMatched(even, tree); in alternatePath()
2637 evenToMatched(even, tree); in alternatePath()
2648 evenToMatched(b, tree); in destroyTree()
|
| /dports/misc/openmvg/openMVG-2.0/src/third_party/lemon/lemon/ |
| H A D | fractional_matching.h | 847 void evenToMatched(Node node, int tree) { in evenToMatched() function
927 evenToMatched(even, tree); in alternatePath()
940 evenToMatched(even, tree); in alternatePath()
948 evenToMatched(n, tree); in destroyTree()
1088 evenToMatched(left_path[i], tree); in cycleOnEdge()
1098 evenToMatched(right_path[i], tree); in cycleOnEdge()
1683 evenToMatched(even, tree); in alternatePath()
1696 evenToMatched(even, tree); in alternatePath()
1704 evenToMatched(n, tree); in destroyTree()
1833 evenToMatched(left_path[i], tree); in cycleOnEdge()
[all …]
|
| H A D | matching.h | 992 void evenToMatched(int blossom, int tree) { in evenToMatched() function
1171 evenToMatched(even, tree); in alternatePath()
1182 evenToMatched(even, tree); in alternatePath()
1193 evenToMatched(b, tree); in destroyTree()
2451 void evenToMatched(int blossom, int tree) { in evenToMatched() function
2626 evenToMatched(even, tree); in alternatePath()
2637 evenToMatched(even, tree); in alternatePath()
2648 evenToMatched(b, tree); in destroyTree()
|