binary_heap.h

Go to the documentation of this file.

 
#ifndef BINARY_HEAP_H
#define BINARY_HEAP_H
 
#include <stdint.h>
#include "pathfinding/maze.h"
 
// Definitions.
// ----------------------------------------------------------------------------
//
 
#ifndef NDEBUG
#include <stdio.h>
 
#define DEBUG_PRINT(...) printf(__VA_ARGS__)
#else
#define DEBUG_PRINT(...)
#endif
 
// Type definitions.
// ----------------------------------------------------------------------------
//
 
typedef struct binary_heap_node
{
    uint16_t priority; 
    maze_grid_cell_t *p_maze_node; 
 
} binary_heap_node_t;
 
typedef struct binary_heap
{
    binary_heap_node_t *p_array; 
    uint16_t capacity; 
 
    uint16_t size; 
} binary_heap_t;
 
// Public functions.
// ----------------------------------------------------------------------------
//
 
void binary_heapify_up(binary_heap_t *p_heap, uint16_t index);
 
void binary_heapify_down(binary_heap_t *p_heap, uint16_t index);
 
void binary_heap_insert(binary_heap_t    *p_heap,
                        maze_grid_cell_t *p_maze_node,
                        uint16_t          priority);
 
maze_grid_cell_t *binary_heap_delete_min(binary_heap_t *p_heap);
 
binary_heap_node_t binary_heap_peek(binary_heap_t *p_heap);
 
uint16_t binary_heap_get_node_idx(const binary_heap_t    *p_heap,
                                  const maze_grid_cell_t *p_maze_node);
 
#endif // BINARY_HEAP_H
 
// End of pathfinding/binary_heap.h