C++ Priority Queue Implementation: Code & Explanation
Classified in Computers
Written on in 
English with a size of 3.58 KB
C++ Priority Queue Implementation
This document provides a C++ implementation of a priority queue using a heap data structure. The code includes the class definition, member functions, and supporting utilities.
Priority Queue Class Definition
#ifndef priority_queue_h_
#define priority_queue_h_
#include <iostream>
#include <vector>
#include <cassert>
template <class T>
class priority_queue {
private:
std::vector<T> m_heap;
public:
priority_queue() {}
priority_queue(std::vector<T> const& values)
{
m_heap = values;
for (int i = 0; i < m_heap.size(); i++){
percolate_down(i);
for (int j = i; j < m_heap.size(); j++){
percolate_down(