0
2
0
... | ... |
@@ -1168,2 +1168,7 @@ |
1168 | 1168 |
|
1169 |
_delta1->clear(); |
|
1170 |
_delta2->clear(); |
|
1171 |
_delta3->clear(); |
|
1172 |
_tree_set->clear(); |
|
1173 |
|
|
1169 | 1174 |
for (NodeIt n(_graph); n != INVALID; ++n) { |
... | ... |
@@ -1907,2 +1912,6 @@ |
1907 | 1912 |
|
1913 |
_delta2->clear(); |
|
1914 |
_delta3->clear(); |
|
1915 |
_tree_set->clear(); |
|
1916 |
|
|
1908 | 1917 |
for (NodeIt n(_graph); n != INVALID; ++n) { |
... | ... |
@@ -1677,2 +1677,5 @@ |
1677 | 1677 |
createStructures(); |
1678 |
|
|
1679 |
_blossom_node_list.clear(); |
|
1680 |
_blossom_potential.clear(); |
|
1678 | 1681 |
|
... | ... |
@@ -1699,2 +1702,9 @@ |
1699 | 1702 |
|
1703 |
_delta1->clear(); |
|
1704 |
_delta2->clear(); |
|
1705 |
_delta3->clear(); |
|
1706 |
_delta4->clear(); |
|
1707 |
_blossom_set->clear(); |
|
1708 |
_tree_set->clear(); |
|
1709 |
|
|
1700 | 1710 |
int index = 0; |
... | ... |
@@ -1704,2 +1714,4 @@ |
1704 | 1714 |
(*_node_data)[index].pot = pot; |
1715 |
(*_node_data)[index].heap_index.clear(); |
|
1716 |
(*_node_data)[index].heap.clear(); |
|
1705 | 1717 |
int blossom = |
... | ... |
@@ -3082,2 +3094,5 @@ |
3082 | 3094 |
createStructures(); |
3095 |
|
|
3096 |
_blossom_node_list.clear(); |
|
3097 |
_blossom_potential.clear(); |
|
3083 | 3098 |
|
... | ... |
@@ -3104,2 +3119,8 @@ |
3104 | 3119 |
|
3120 |
_delta2->clear(); |
|
3121 |
_delta3->clear(); |
|
3122 |
_delta4->clear(); |
|
3123 |
_blossom_set->clear(); |
|
3124 |
_tree_set->clear(); |
|
3125 |
|
|
3105 | 3126 |
int index = 0; |
... | ... |
@@ -3109,2 +3130,4 @@ |
3109 | 3130 |
(*_node_data)[index].pot = pot; |
3131 |
(*_node_data)[index].heap_index.clear(); |
|
3132 |
(*_node_data)[index].heap.clear(); |
|
3110 | 3133 |
int blossom = |
0 comments (0 inline)