Prev Up Home igraph Reference Manual Next

7.6. igraph_heap_top — Top element.

igraph_real_t igraph_heap_top(igraph_heap_t* h);

For maximum heaps this is the largest, for minimum heaps the smallest element of the heap.

Arguments: 

h:

The heap object.

Returns: 

The top element.

Time complexity: O(1).

<< 7.5. igraph_heap_push — Add an element. 7.7. igraph_heap_delete_top — Return and removes the top element >>