More Problems

• Write a program to check if a directed graph can be made strongly connected by removing edges.
• Implement an algorithm to find the shortest cycle in a directed graph using dynamic programming.
• Write a program to find all simple paths in a weighted directed graph using dynamic programming.
• Implement an algorithm to find the number of paths of length k in a directed acyclic graph.
• Write a program to find the longest simple path in a weighted directed graph using dynamic programming.
• Implement an algorithm to calculate the average distance from a source vertex to all other vertices in a bipartite graph.
• Write a program to find the longest path in a directed bipartite graph.
• Implement an algorithm to check if a bipartite graph contains any back edges using DFS.