More Problems

• Implement an algorithm to find the longest path that visits every edge in a weighted directed graph.
• Write a program to check if a directed graph contains any cycles using Tarjans algorithm.
• Implement an algorithm to find the longest simple path that visits every vertex in a weighted directed graph.
• Write a program to find all Hamiltonian paths in a directed graph using backtracking.
• Implement an algorithm to check if a directed graph is strongly connected using Tarjans algorithm.
• Write a program to find the longest path in a directed bipartite graph using dynamic programming.
• Implement an algorithm to check if a directed graph can be made bipartite by adding edges.
• Write a program to calculate the number of spanning trees in a directed graph using Kirchhoff’s theorem.