More Problems

• Write a program to calculate the total number of paths in a directed acyclic graph.
• Implement an algorithm to check if a directed graph contains any back edges using Kahns algorithm.
• Write a program to find the longest path in a tree using dynamic programming.
• Implement an algorithm to find the minimum cut in a directed graph using the Max-Flow Min-Cut Theorem.
• Write a program to find the number of simple cycles in a bipartite graph.
• Implement an algorithm to find the longest path in a weighted directed graph using dynamic programming.
• Write a program to check if a bipartite graph can be colored with three colors.
• Implement an algorithm to find all paths from a source vertex in a directed graph using DFS.