More Problems

• Write a program to find the shortest path between all pairs of vertices in a directed graph using Floyd-Warshall.
• Implement an algorithm to find the longest path that visits every vertex in a directed graph.
• Write a program to check if a directed graph contains any cycles using Tarjans algorithm.
• Implement an algorithm to find the longest increasing path in a weighted directed graph using dynamic programming.
• Write a program to find the number of spanning trees in a directed graph using Kirchhoff’s theorem.
• Implement an algorithm to calculate the number of edges in a bipartite graph that do not form a cycle.
• Write a program to check if a directed graph is strongly connected using Kosarajus algorithm.
• Implement an algorithm to find the longest path in a weighted graph using backtracking.