void heap_decrease_distance(Heap *h, Node *n, unsigned int val, Node *prev)
Decrease distance of a certain node.
bool heap_is_empty(Heap *h)
Test if a heap is empty.
Node * heap_extract_min(Heap *h)
Remove minimal element from the heap, i.e.
struct node Node
Node is an opaque type.
Heap * heap_new_from_graph(Graph *g)
Create new heap with nodes from given graph.
void heap_free(Heap *h)
Free all memory used by the heap.
Interface for creating graph.
struct heap Heap
Heap is an opaque structure.
struct graph Graph
Graph is an opaque type.