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 longest path in a weighted directed graph using dynamic programming.
• Write a program to find the longest path that visits every edge in a weighted bipartite graph.
• Implement an algorithm to check if a directed graph is strongly connected using Tarjans algorithm.
• Write a program to calculate the average distance from a source vertex to all other vertices in a weighted directed graph.
• Implement an algorithm to find all simple paths from a source vertex to a target vertex in a directed graph.
• 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.