More Problems

• Implement an algorithm to check if a directed graph is a valid topological sort using the in-degree method.
• Write a program to find the number of edge-disjoint paths in a weighted directed graph.
• Implement an algorithm to find the maximum flow in a bipartite graph using the Push-Relabel method.
• 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.