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 weighted bipartite graph using dynamic programming.
• Implement an algorithm to calculate the number of edges in a directed graph that do not form a cycle.
• Write a program to find all paths of length k in a weighted directed graph.
• Implement an algorithm to check if a directed graph is strongly connected using Kosarajus algorithm.
• Write a program to find the longest increasing path in a directed graph using dynamic programming.
• Implement an algorithm to find the maximum matching in a directed bipartite graph.
• Write a program to find all Hamiltonian paths in a weighted directed graph using dynamic programming.