Due date: 9/11/2017 CS 101 Project 1 For this project you will read from a file, one line at a time, and process each line as you read it. The file will contain at most 1000 lines, where each line will have 3 values. The file represents a network, and the first two values are strings that are network identifiers and the third value represents the bandwidth available (in Mb/s) from the first identifier to the second identifier The identifiers can appear in the file multiple times, so your first job is to maintain a list of unique identifiers. The identifiers can contain only letters and numbers and are not case sensitive. They should be converted to all caps. You should produce the following output: A list of the unique identifiers from the file, output in the order that they appear in the file, one per line. We will define a leaf node of the network to be an identifier that only appears as a first identifier or one that only appears as a second identifier. For all non-leaf identifiers, output the identifier, the sum of the bandwidth “to” that identifier, the sum of the bandwidth “from” that identifier, and the ratio of the “to”/”from” as a two decimal point float. Requirements Please carefully read the following requirements . The first command line parameter will be the name of the input file, and the output should go to “standard output”, ie. using cout. Don’t do this wrong! . You should not include libraries other than iostream, fstream, iomanip, and string. You must use Gt+ streams for all I/O . You should store the distinct identifi iers as an array of strings. There will be no more than 1000 distinct identifiers in the input. .You must format your output exadtlyas shown in the example below .You must supply a makefilethat supportsthecommand “make” and produces an executable named project1 .You must do your own work, you must not share code, youmust submit your project in a zipfile as specified under submission
