More Problems

• Implement an algorithm to find the longest increasing subsequence in a directed acyclic graph.
• Write a program to check if a bipartite graph contains any cycles.
• Implement an algorithm to find the shortest cycle in a directed graph using dynamic programming.
• Write a program to determine if a bipartite graph can be partitioned into two equal subsets.
• Implement an algorithm to find all paths of length k between two vertices in a directed graph.
• Write a program to find the diameter of a tree using two BFS/DFS traversals.
• Implement an algorithm to calculate the number of edge-disjoint spanning trees in a weighted graph.
• Write a program to check if a directed graph is a valid topological sort.