More Problems

• 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.
• Implement an algorithm to solve the "Traveling Salesman Problem" using dynamic programming.
• Write a program to check if a graph is k-colorable.
• Implement an algorithm to find all simple cycles in a directed graph.
• Write a program to find the maximum weight independent set in a tree.
• Implement an algorithm to calculate the number of connected components in a bipartite graph.
• Write a program to find the shortest path between two vertices in a directed graph with negative edges.