Lines Matching refs:min
114 if (heap->min == NULL || node->key < heap->min->key) in fibheap_insert()
115 heap->min = node; in fibheap_insert()
127 if (heap->min == NULL) in fibheap_min()
129 return heap->min->data; in fibheap_min()
137 if (heap->min == NULL) in fibheap_min_key()
139 return heap->min->key; in fibheap_min_key()
169 if (fibheap_compare (heapa, heapb->min, heapa->min) < 0) in fibheap_union()
170 heapa->min = heapb->min; in fibheap_union()
184 if (heap->min != NULL) in fibheap_extract_min()
232 if (fibheap_compare (heap, node, heap->min) <= 0) in fibheap_replace_key_data()
233 heap->min = node; in fibheap_replace_key_data()
262 if (node != heap->min) in fibheap_delete_node()
276 while (heap->min != NULL) in fibheap_delete()
293 fibnode_t ret = heap->min; in fibheap_extr_min_node()
313 heap->min = NULL; in fibheap_extr_min_node()
318 heap->min = ret->right; in fibheap_extr_min_node()
391 heap->min = NULL; in fibheap_consolidate()
396 if (heap->min == NULL || fibheap_compare (heap, a[i], heap->min) < 0) in fibheap_consolidate()
397 heap->min = a[i]; in fibheap_consolidate()