More Problems

• Write a program to find all maximal independent sets in a directed graph.
• Implement an algorithm to calculate the number of edge-disjoint paths in a directed bipartite graph.
• Write a program to find the shortest path from a source vertex to all other vertices in a directed graph.
• Implement an algorithm to check if a directed graph is strongly connected using Kosarajus algorithm.
• Write a program to find the longest path in a weighted bipartite graph using dynamic programming.
• Implement an algorithm to calculate the average degree of vertices in a directed bipartite graph.
• Write a program to find the number of simple cycles in a directed graph using dynamic programming.
• Implement an algorithm to check if a bipartite graph contains any simple paths using backtracking.