More Problems

• Implement an algorithm to calculate the number of edges in a directed graph that form a cycle.
• Write a program to find the longest path that visits every vertex in a weighted directed graph.
• Implement an algorithm to find all maximal independent sets in a directed graph using backtracking.
• Write a program to check if a bipartite graph can be colored with three colors using backtracking.
• Implement an algorithm to find the number of Hamiltonian cycles in a directed bipartite graph using dynamic programming.
• Write a program to calculate the longest path in a weighted directed graph.
• Implement an algorithm to check if a directed graph contains any back edges using DFS.
• Write a program to find the longest increasing path in a directed acyclic graph using dynamic programming.