Assignment 3. Topological sort
Completion requirements
Opened: Saturday, 11 March 2023, 12:00 AM
Design a program that builds topological sort for the given digraph. If the graph is not a DAG, return ‘Not a DAG’.
Input file format is the same as for the assignment 1.
Output file must contain the list of vertices in the topological order. If the input file is not a DAG, the output file must contain only one line ‘Not a DAG’.- 20 March 2023, 6:02 PM
- 11 March 2023, 7:14 PM