Question

Imagine that you are working for a logistics company operating out in the frontiers of
civilisation. Your boss wants to be able to run some basic analytics on some of the
routes that you currently support and wants you to implement some systems to help
her. However the current limitations of the legacy system prevent you from making
fundamental changes. Instead, you will need to use inheritance in order to achieve your
goal.

Vehicle Class
The vehicle class is the parent class of the derived class: maglev. Their inheritance will
be public inheritance so reflect that appropriately in their .h files. The description of the
vehicle class is given in the simple UML diagram below:

vehicle
-map: char**
-name: string
-size:int
--------------------------
+vehicle()
+getSize():int
+setName(s:string):void
+getName():string
+getMap():char**
+setMap(s: string):void
+getMapAt(x:int, y:int):char
+∼vehicle()
+operator−−():void
+determineRouteStatistics()=0:void
The class variables are as follows:
• map: A 2D array of chars, it will represent the map that each vehicle will have to
travel on.
• name: The name of the vehicle. For example, ”Frontier Express”.
• size: The size of the map as a square matrix.
The class methods are as follows:
• vehicle: This is the constructor of the class. It is simply the default constructor
with no additional features.
• getSize: This returns the size of the map as a square matrix.
• setName: This will set the name of the vehicle as received.
• getName: This will return the vehicle as set.
• getMap(): This will return the entire map variable.
• setMap(): This method receives the name of a text file that contains an ASCII map.
The map will be a square, equal number of rows and columns. The first line of the
map will have the number of rows. Every line after will contain a number of ASCII
characters that you must read into the map. This must allocate memory before
assigning the map. The textfile that you will receive in input has no delimiters.
On each line, all the characters are written out with no spaces or commas or other
delimiters separating them. For example:
-#--
• getMapAt: This receives two coordinates, an x and y, and returns what character
is located at those coordinates. If the coordinates are out of bounds, return ’:’.
∼vehicle: The destructor for the class. It has been made virtual.
• determineRouteStatistics: This function will be used to determine information from
the map based on requirements specific to the vehicle in question. As it stands, it
is made pure virtual.
• operator−−: The overload of this operator will deallocate the memory allocated for
the map.

Maglev Class
The description of the maglev class is given by the simple UML diagram below:
maglev
-perUnitCost: double
---------------------------------
+maglev()
+~maglev()
+getUnitCost():double
+setUnitCost(s:double):void
+calculateStraightDistance():double
+determineRouteStatistics():void
The class variables are as follows:
• perUnitCost: This is the cost of moving the maglev from one part of the track to
the other a distance of one unit of rail.
The class methods have the following behaviour:
• maglev: The constructor of the class. It has no features beyond the default.
• ∼maglev: This is the class destructor that will deallocate the memory assigned by
the class. It will also print out, ”maglev removed”, without the quotation marks
and ended by a new line.
• getUnitCost: This returns the per unit cost.
• setUnitCost: This sets the per unit cost.
• determineRouteStatistics: This function needs to calculate the specific statistics for
the locomotive based on the map it is provided. The following key shows all the
specific elements that are pertinent to the locomotive:
1. O: Origin Points. This is where the trains will be expected to leave from.
2. E: Exit Points. This is where the train is expected to go towards.
3. #: Railroad. This is traversable tracks for the train. Locomotives can only
travel on the map where there is track laid.
The function will then determine a number of statistics and print them to the screen
in a neatly formatted way:
1. calculateStraightDistance: This will calculate a straight line distance, using
the Euclidean distance metric, between the origin and exit components in the
map. It will return this distance.
2. Distance: Distance from the origin to exit in units, where one ”#” is one unit
so a track of ”### ” is a 3 unit long track. This does not include the origin
and exit points.
3. Journey Cost: This is the cost of operating the maglev on the track. It is the
perUnitCost of the maglev multiplied against the number of tracks the maglev
has to move over in the map.
4. Straight Distance: This is a straight line distance calculation from the origin
to the exit position on the map. This would represent the path of a flying
vehicle, such as a plane, moving directly between the two stations.
Display the information as follows:
Name: Frontier Maglev
Origin Coordinates: 1,2
Exit Coordinates: 8,7
Straight Distance: 13.5
Distance: 16
Journey Cost: 3000000
Finally an example small map is provided below:
O#--
-#--
-#--
-##E
You will be allowed to use the following libraries: cmath, fstream, cstring, string,
iostream. You will have a maximum of 10 uploads for this task. Your submission must
contain vehicle.h, vehicle.cpp, maglev.h, maglev.h,map1.txt, main.cpp and a
makefile.

Answer 1

#######################################
          maglev.cpp
#######################################
#include "maglev.h"
#include<fstream>
#include<cstring>
#include<cmath>

Maglev::Maglev() {
        perUnitCost = 0;
}
Maglev::~Maglev() {
        cout << "Electric Locomotive removed" << endl;
}
double Maglev::getUnitCost() {
        return perUnitCost;
}
void Maglev::setUnitCost(double s) {
        perUnitCost = s;
}

// position(r, c) is where we start, We need to reach till
// we get cell 'E'
// Also, We keep a boolean array to mark the cells which
// are already visited
int distanceHelperMag(char **map, int size, int r, int c, bool **visited) {
        // if current cell is invalid or visited, Then return -1 to show error
        if(r < 0 || r >= size || c < 0 || c >= size 
                || visited[r][c] || map[r][c] == '-') {
                return -1;
        }

        visited[r][c] = true;
        if(map[r][c] == 'E') {
                return 0;
        }

        // Try visiting to neighbors.
        int dis = distanceHelperMag(map, size, r+1, c, visited);
        if(dis != -1) {
                return 1 + dis;
        }
        dis = distanceHelperMag(map, size, r-1, c, visited);
        if(dis != -1) {
                return 1 + dis;
        }
        dis = distanceHelperMag(map, size, r, c+1, visited);
        if(dis != -1) {
                return 1 + dis;
        }
        dis = distanceHelperMag(map, size, r, c-1, visited);
        if(dis != -1) {
                return 1 + dis;
        }

        return -1; // Not possible to reach
}

void Maglev::determineRouteStatisitcs() {
        char **map = Vehicle::getMap();
        int size = Vehicle::getSize();

        int originRow, originCol;
        int exitRow, exitCol;
        
        for(int i=0; i<size; i++) {
                for(int j=0; j<size; j++) {
                        if(map[i][j] == 'O') {
                                originRow = i;
                                originCol = j;
                        }
                        if(map[i][j] == 'E') {
                                exitRow = i;
                                exitCol = j;
                        }
                }
        }

        // TODO, Find the logic for reaching to the destination
        // And it the trip is viable
        bool **visited = new bool*[size];
        for(int i=0; i<size; i++) {
                visited[i] = new bool[size];
                for(int j=0; j<size; j++) {
                        visited[i][j] = false;
                }
        }

        cout << "Name: " << Vehicle::getName() << endl;
        cout << "Origin Coordinate: " << originRow << "," << originCol << endl;
        cout << "Exit Coordinate: " << exitRow << "," << exitCol << endl;

        int distance = distanceHelperMag(map, size, originRow, originCol, visited);
        if(distance == -1) {
                cout << "End location can not be reached from origin." << endl;
        } else {
                cout << "Straight distance: " << calculateStraightDistance() << endl;
                cout << "Distance: " << distance << endl;
                cout << "Cost: " << distance * perUnitCost << endl;
        }
        
        // free the visited array we created for tracking.
        for(int i=0; i<size; i++) {
                delete [] visited[i];
        }
        delete [] visited;
}

double Maglev::calculateStraightDistance() {
        char **map = Vehicle::getMap();
        int size = Vehicle::getSize();

        int originRow, originCol;
        int exitRow, exitCol;
        
        for(int i=0; i<size; i++) {
                for(int j=0; j<size; j++) {
                        if(map[i][j] == 'O') {
                                originRow = i;
                                originCol = j;
                        }
                        if(map[i][j] == 'E') {
                                exitRow = i;
                                exitCol = j;
                        }
                }
        }

        double dis = sqrt(pow(originRow - exitRow, 2) + pow(originCol - exitCol, 2) );
        return dis;
}

#######################################
maglev.h
#######################################

#ifndef MAGLEV_H
#define MAGLEV_H

#include <iostream>
#include "vehicle.h"

using namespace std;

class Maglev: public Vehicle {
        
        double perUnitCost;

        public:
        Maglev();
        ~Maglev();
        double getUnitCost();
        void setUnitCost(double s);
        double calculateStraightDistance();
        void determineRouteStatisitcs();
};


#endif

**************************

Please consider providing a thumbs up to this question if it helps you. by Doing that, You will help other students, who are facing similar issue.