More Problems

• Implement an algorithm to check if a directed graph contains any back edges.
• Write a program to find the longest path in a directed graph using dynamic programming.
• Implement an algorithm to find the shortest path between two vertices in a weighted directed graph.
• Write a program to find all simple paths in a weighted directed graph.
• Implement an algorithm to check if a bipartite graph is k-colorable.
• Write a program to find the maximum flow in a directed graph using augmenting paths.
• Implement an algorithm to check if a directed graph can be made strongly connected by adding edges.
• Write a program to find all paths from a source vertex to all other vertices in a directed graph using BFS.