This repository includes all the projects that I have completed while taking the course. In the "Implementing Graphs and Dijkstra's Algorithm", I have implemeted Dijkstra's algorithm, heap priority queue, hash set, hash map, and hash graph. In the "Implementing Maps and Sets via Hash Tables", I have implemented Hash map and Hash set. The program can be run using driver.cpp. In the "Implementing Priority Queues and Maps with Binary Trees", I have implemeted bst map and priority queue. Use driver.cpp to run the program. In the "Implementing Queue/Priority Queue / Set with Linked Lists" I have implemeted linked priority queue, linked queue and linked set. Use driver.cpp to run the program.

I used Eclipse to implement above data structures. The folders can be directly downloaded and run through Eclipse environment.