Write your own compare function in C++ to compare two dates and find which is earlier. Use this compare function to create a min-heap to find the employee who is senior-most w.r.t. date of joining. Use the previous Min heap class. In node use class Date { int month; int day; int year; public: Date(int, int, int); Date& operator < (const Date
Write your own compare function in C++ to compare two dates and find which is earlier. Use this compare function to create a min-heap to find the employee who is senior-most w.r.t. date of joining.
Use the previous Min heap class. In node use
class Date
{
int month;
int day;
int year;
public:
Date(int, int, int);
Date& operator < (const Date & ref) const;
// and other relational operators
// and complete class
};
class Employee
{
string first_name;
string last_name;
int age;
Date date_of_joining;
};
class Min_heap;
Following functionalities are required to be done as your main task in C++.
Implementation of the basic graph class. And following marks are as follows.
- Count all possible paths between two nodes.
- Find a transpose graph, in which all incoming edges will become outgoing edges and vice versa.
- Find single source all destination shortest paths using Dijkstra’s
algorithm . - Find the shortest path between a source and a destination vertex. Any algorithm except Dijkstra.
Step by step
Solved in 2 steps
