More Problems

• 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.
• Write a program to find all paths of length k in a directed graph.
• Implement an algorithm to calculate the average shortest path length in a bipartite graph.
• Write a program to find the maximum matching in a bipartite graph using the Hopcroft-Karp method.
• Implement an algorithm to check if a directed graph can be made bipartite by adding edges.