[Solved] CECS328-Lab8

Programming assignment 8.

Note: you can have different names for vertices: {a b c d e ..} = {v1 v2 v3 v4 ..} = {1 2 3 4 ..}

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.

1. Run DFS function to check if the graph is a DAG (directed acyclic graph):
2. • Search for backward edges. If there are any, print: Cycle detected, topological sort is impossible.
3. 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.