More Problems

• Implement an algorithm to calculate the transitive closure of a directed graph using Floyd-Warshall.
• Write a program to find the number of unique paths from the top-left to the bottom-right of a grid.
• Implement an algorithm to find the longest path that visits every edge of a graph.
• Write a program to check if a bipartite graph can be 3-colored.
• Implement an algorithm to find the maximum weight path in a directed acyclic graph.
• Write a program to solve the "Max Flow Min Cut Theorem" in a directed graph.
• Implement an algorithm to calculate the number of edge-disjoint spanning trees in a directed graph.
• Write a program to find the longest path in a tree using dynamic programming.