More Problems

• Implement an algorithm to find the maximum cardinality matching in a bipartite graph.
• Write a program to check if a directed graph is Eulerian using the adjacency list.
• Implement an algorithm to find all paths from a source to a sink in a network flow graph.
• Write a program to calculate the number of edges in a minimum spanning tree.
• Implement an algorithm to find the diameter of a graph using BFS.
• Write a program to check if two trees are isomorphic using DFS.
• Implement an algorithm to find all strongly connected components using Tarjans algorithm.
• Write a program to find the maximum flow in a directed graph using the Ford-Fulkerson method.