This project implements a program used for a conceptual rental agency. The user inputs a list of clients in the format of <starting date> <end date> <payment offered for rental period>. The program will then create a DAG of all clients in which all edges are connected between a client whose end date is less than or equal to another client's start date.
Input must be in the format:
start1 end1 payment1
for example:
10 40 100
50 80 200
70 60 23
Example input can be found in the included data(num).txt files.
The program will output a file named out<inputfile>.txt where <inputfile> is the name of the file a user choses to input.
All output files for data.zip will be in the data_output directory.
Example output can be found in the included outdata(num).txt files.
Follow these steps to run the program.
-
Add all input files to the
CS415_Project02directory. -
Run the following commands to build the project.
$ git clone https://github.com/vinnyvalenz/CS415_Project02.git
$ cd CS415_Project02
$ make
-
Run this command to execute the program.
$ ./optimalPath.x -
Once the program is running you'll be prompted with:
Enter the file to read data:- Enter the name of the file to be read. For example:
Enter the file to read data: data2.txt
- Enter the name of the file to be read. For example:
-
The program will generate ouput in the console and generate/write the output file.
The program parses a client file and creates a DAG. The DAG is represented in an adjacency matrix (extra credit not implemented). An array of all connnected nodes is generated using a queue-based decrease-by-one (extra credit applicable) topological sort of the DAG. The longest (highest cost) path is then calculated using that array.