More Problems

• Write a program to check if a directed graph contains any back edges using Kahns algorithm.
• Implement an algorithm to find all paths of length k in a weighted directed graph.
• Write a program to check if a bipartite graph can be colored with three colors using backtracking.
• Implement an algorithm to calculate the number of edges in a directed graph that form a cycle.
• Write a program to find the longest increasing path in a directed graph using dynamic programming.
• Implement an algorithm to find all Hamiltonian cycles in a directed bipartite graph using backtracking.
• Write a program to find the maximum flow in a directed graph using the Push-Relabel method.
• Implement an algorithm to check if a directed graph is bipartite using adjacency matrices.