More Problems

• Implement a program to perform DFS on a directed acyclic graph (DAG).
• Write a function to print all cycles in a directed graph.
• Implement a program to calculate the size of the largest strongly connected component in a directed graph.
• Write a program to check if an edge is a cut edge in an undirected graph.
• Implement a function to check if two nodes are in the same connected component.
• Write a program to find the maximum bipartite matching using DFS.
• Implement a function to check if a directed graph has any self-loops.
• Write a program to find the number of trees in a forest.