More Problems

• Implement an algorithm to check if a directed graph is strongly connected using Tarjans algorithm.
• Write a program to find the longest increasing path in a weighted directed graph.
• Implement an algorithm to find the minimum spanning tree of a graph with both positive and negative edges.
• Write a program to check if a directed graph contains any simple cycles using DFS.
• Implement an algorithm to find the longest path that visits every vertex in a bipartite graph.
• Write a program to find the number of maximal cliques in a directed graph.
• Implement an algorithm to calculate the maximum weight independent set in a bipartite graph.
• Write a program to find the longest path in a tree using dynamic programming.