Write a C++ program called ts.cpp that implements the topological sorting algorithm based on the source-removal algorithm. Your program should read an input file name. Then it should display the topological ordering. In the problem, you can assume that the number of vertices in the input file is less than 50. Additionally, you can assume that the input graph is always a DAG (= Directed Acyclic Graph). When you write the program, dont forget to include Title, Abstract, ID (A four-digit number), Name, and Date.

Input file format: This is a sample input file called t1.txt.

The first line (= 3 in the example) indicates that there are three vertices in the graph. For the homework, we can assume that the first vertex starts from the number 0. Thus, t1.txt describes a directed graph like below:

One blank space is used to delimiter the data. Note that theres no blank space at the end of each line. If your program does not read the file properly, your program will get no credit.

The following presents a sample run of the program. Your program should be compiled and executed exactly like this.

Enter filename: C:\\tmp\\t1.txt

Topological sort: 0 -> 1 -> 2

In the program, your program has to follow our convention (= ascending order).

This is another sample input file called t2.txt.

This is a sample run:

Enter filename: C:\\tmp\\t2.txt

Topological sort: 0 -> 1 -> 2 -> 3 -> 4

Again, your program must follow our convention (= ascending order). So, your program should remove the vertex 0 first between the two source vertices 0 and 1.

010 100 3000