Description
In this program you are required to implement DFS.
First, you can create the below graphs and print the resulting adjacency matrices/lists. Or create a random graph.
- Run DFS function to check if the graph is a DAG (directed acyclic graph):
- Search for backward edges. If there are any, print: “Cycle detected, topological sort is impossible”.
- If the graph is DAG, (while running DFS):
- Insert the vertex into a linked list as it finishes.
- Using your linked list, print the topological order of the vertices along with their start/finish time.
