Assignment $5$: Implementation of Priority Queue ADT Using NodeListG

Implement the Priority Queue Abstract Data Type $($ADT$)$ using the NodeListG as defined in Lesson $7.$ This

implementation should employ Object$-$Oriented Programming $($OOP$)$ principles and C$++$ templates,

enabling the ADT to manage elements of any type efficiently.

Part $1$: Implementation

NodeListG Implementation

Incorporate all the $.$cpp and $.$h files previously utilized to implement the NodeListG as part of the List

Abstract Data Type $($ADT$)$ from Lesson $7$:

#ifndef DNODEG$\_$H$\_$

#define DNODEG$\_$H$\_$

#include

using namespace std;

template

class NodeListG;

template

class IteratorG;

template

class DNodeG$\{$

private:

T elem;

DNodeG $*$next;

DNodeG $*$prev;

friend class NodeListG;

friend class IteratorG;

$\}$;

#endif

PriorityQueueG Implementation

Utilize PriorityQueueG class $($Lesson $10$ example $1)$:

#ifndef PRIORITYQUEUEINTERFACE$\_$PRIORITYQUEUEG$\_$H$\_$

#define PRIORITYQUEUEINTERFACE$\_$PRIORITYQUEUEG$\_$H$\_$

template $//$ Element, comparator and Exception

class PriorityQueueG$\{$

public:

virtual ~ PriorityQueueG$()=$ default;

virtual int size$()$ const $=0$; $//$ number of elements

virtual bool isEmpty$()$ const $=0$; $//$ is the queue empty?

virtual void insert$($const E& e$)=0$; $//$ insert element

virtual const E& min$()$ const throw$($R$)=0$; $//$ minimum element

virtual void removeMin$()$ throw$($R$)=0$; $//$ remove minimum

$\}$;

#endif

ListPriorityQueueG Class Implementation

Implement the templated class $`$ListPriorityQueueG$`$ to manage elements in a priority queue using

NodeListG from Lesson $7.$ This class should be flexible to handle any type of elements defined by the

user with the help of a comparator for ordering.

ListPriorityQueueG.h $($Header File$)$:

$$ Member Variables $($Private$)$:

o NodeListG L; $//$ priority queue contents, E represents the element type

o C comp; $//$ comparator

$$ Member Functions $($Public$)$:

o ListPriorityQueueG$()$;

o virtual ~ListPriorityQueueG$()$;

o int size$()$ const; $//$ Returns the number of elements in the queue

o bool empty$()$ const; $//$ Checks if the queue is empty

o void insert$($const E& e$)$; $//$ insert an element into the queue.

o const E& min$()$ const throw$($R$)$; $//$returns the min element using comp.

o void removeMin$()$ throw$($R$)$; $//$ remove the min element using comp.

ListPriorityQueueG.cpp $($Implementation File$)$:

$$ Implement all member functions declared in ListPriorityQueueG.h$.$

Point$2$D and Comparators Implementation

Utilize Point$2$DSTL $($rename it Point$2$D$)$ and LeftRight $($comparator$)$ classes $($Lesson $10$ example $1$:

#ifndef POINT$2$DSTL$\_$H$\_$

#define POINT$2$DSTL$\_$H$\_$

#include

using namespace std;

class Point$2$DSTL$\{$

private:

double x$,$ y;

public:

Point$2$DSTL$()\{$

$\}$

Point$2$DSTL$($double xcoord, double ycoord$)$

$\{$

x $=$ xcoord;

y $=$ ycoord;

$\}$

double getX$()$ const $\{$ return x; $\}$

double getY$()$ const $\{$ return y; $\}$

friend ostream& operator$<<($ostream& out, const Point$2$DSTL& q$)$

$\{$

out $<<$ q$.$getX$()<<""<<$ q$.$getY$()$;

return out;

$\}$

$\}$;

class LeftRight

$\{$

public:

bool operator$()($const Point$2$DSTL& p$,$ const Point$2$DSTL& q$)$ const

$\{$

return p$.$getX$()<$ q$.$getX$()$;

$\}$

$\}$;

#endif

Exception Handling Implementation

Utilize RuntimeException and PriorityQueueException classes $($Lesson $10$ example $1$:

#ifndef STACKEXCEPTION$\_$H$\_$

#define STACKEXCEPTION$\_$H$\_$

#include

#include "RuntimeException.h$"$

using namespace std;

$//$ Exception thrown on performing top or pop of an empty stack.

class PriorityQueueException: public RuntimeException $\{$

public:

PriorityQueueException$($const string& err$)$ : RuntimeException$($err$)\{\}$

$\}$;

#endMain Function Implementation

Implement the main function in a separate $.$cpp file $($name it main.cpp$)$ to demonstrate the functionality

of the ListPriorityQueueG class.

Test ListPriorityQueueG operations in the main function. Inside the main function:

$$ Create an object of type ListPriorityQueueG

$$ Add $4$ different Point$2$D objects.

$$ Utilize a while loop to print all Point$2$D objects by calling min$()$ and removeMin$()$ member

functions.

$$ Create an object of type ListPriorityQueueG

$$ Add $4$ different Point$2$D objects.

$$ Utilize a while loop to print all Point$2$D objects by calling min$()$ and removeMin$()$ member

functions.

Part $2$: Implementation Explanation Document

In addition to the practical coding component of this assignment, you are required to submit a brief

document explaining your implementation. This document should provide insights into your design

choices, the challenges you encountered, and how you tested your program to ensure its correctness.