More Problems

• Write a program to determine if a directed graph can be 3-colored.
• Implement an algorithm to find the maximum weight matching in a bipartite graph using the Hungarian method.
• Write a program to find the longest path in a weighted directed acyclic graph using dynamic programming.
• Implement an algorithm to find all simple paths in a weighted graph.
• Write a program to find the number of Hamiltonian paths in a bipartite graph.
• Implement an algorithm to check if a directed graph can be strongly connected by adding edges.
• Write a program to compute the transitive reduction of a directed graph.
• Implement an algorithm to find the longest increasing subsequence in a directed acyclic graph.