More Problems

• Write a program to check if a directed graph is Eulerian using Fleurys algorithm.
• Implement an algorithm to find the longest simple path that visits each vertex at least once in a directed graph.
• Write a program to find the number of edges in a bipartite graph that form a cycle.
• Implement an algorithm to calculate the average path length in a bipartite graph.
• Write a program to find the maximum flow in a weighted bipartite graph.
• Implement an algorithm to check if a directed graph is strongly connected using Kosaraju’s algorithm.
• Write a program to find the longest increasing path in a weighted graph.
• Implement an algorithm to check if a bipartite graph can be partitioned into two equal subsets.