More Problems

• Write a program to check if a directed graph contains any back edges using DFS.
• Implement an algorithm to find the longest increasing path in a bipartite graph using dynamic programming.
• Write a program to find the longest path in a bipartite graph.
• Implement an algorithm to calculate the number of edges in a directed bipartite graph.
• Write a program to check if a directed graph can be made bipartite by removing edges.
• Implement an algorithm to find all maximal independent sets in a bipartite graph using backtracking.
• Write a program to check if two directed graphs are isomorphic using their adjacency lists.
• Implement an algorithm to find the maximum flow in a weighted directed graph using augmenting paths.