More Problems

• Write a program to check if a directed graph can be made strongly connected by removing edges.
• Implement an algorithm to find the maximum flow in a weighted bipartite graph using the Hopcroft-Karp algorithm.
• Write a program to check if a directed graph contains any back edges using DFS.
• Implement an algorithm to find the longest simple cycle in a directed graph using backtracking.
• Write a program to find the maximum weight independent set in a directed graph.
• Implement an algorithm to calculate the number of paths from a source vertex to all other vertices in a bipartite graph.
• Write a program to find all maximal independent sets in a bipartite graph using backtracking.
• Implement an algorithm to check if a directed graph is a valid topological sort using adjacency lists.