Objective To implement Depth First Search (DFS) and to use it to do
topological sorting of a directed acyclic graph (DAG)
Input
Task
Submission
● The program you submit should output ‘ts.txt’ when run.
● Follow some coding style uniformly. Provide proper comments in your code.
Evaluation
algorithms contains exactly the same set of vertices in the DAG;
*****[Note: The given input.graph might also contain Isolated vertices, which means that this type of vertices do not contain any in-coming or out-going edges. These vertices are not present in the input.graph file, but these vertices should be present in the output file ts.txt]
We will not be using ‘diff’ for the evaluation of this assignment.
