Max Heap implementation in C++ using dynamic arrays.
-
Updated
May 25, 2020 - C++
Max Heap implementation in C++ using dynamic arrays.
The project is a network model of priority based packet routing implemented using the priority queue using max heap data structure. The project mimics packet routing, by receiving network packets (file handling concept) and re-transmitting the packets based on network priority.
This a bike-rental system aimed to leverage the gross profit for the company.
Add a description, image, and links to the max-heap-priority-queue topic page so that developers can more easily learn about it.
To associate your repository with the max-heap-priority-queue topic, visit your repo's landing page and select "manage topics."