Use Depth First Search (DFS) to detect cycle in a graph. Remove an edge from the cycle to make it acyclic.

• Implement Depth First Search (DFS) to detect cycles in the graph

• If a back edge is found during...read more