More Problems

• 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.
• Implement an algorithm to check if a directed graph is a valid topological sort.
• Write a program to find the longest simple path in a graph with cycles.
• Implement an algorithm to solve the "Dominating Set Problem" in a graph.
• Write a program to check if a directed graph can be made acyclic by removing one edge.