More Problems

• Implement an algorithm to check if a graph is planar using Kuratowskis theorem.
• Write a program to find the maximum flow in a bipartite graph using the Hopcroft-Karp algorithm.
• Implement an algorithm to compute the diameter of a graph using two BFS/DFS traversals.
• Write a program to solve the "Steiner Tree Problem" in a weighted graph.
• Implement the Kahns algorithm for topological sorting in a directed graph.
• Write a program to find all articulation points and bridges in a graph using DFS.
• Implement an algorithm to calculate the chromatic number of a graph using graph coloring.
• Write a program to find all simple cycles in a directed graph using Johnsons algorithm.