More Problems

• Write a program to check if a directed graph contains any simple cycles using DFS.
• Implement an algorithm to find the longest path that visits every edge in a directed bipartite graph.
• Write a program to calculate the total number of paths from a source vertex to all other vertices in a directed graph.
• Implement an algorithm to find the longest simple path in a directed graph using DFS.
• Write a program to check if a directed graph is strongly connected using Kosarajus algorithm.
• Implement an algorithm to calculate the number of edge-disjoint paths in a directed bipartite graph.
• Write a program to find the maximum weight independent set in a directed bipartite graph using dynamic programming.
• Implement an algorithm to check if a bipartite graph is k-colorable using adjacency matrices.