More Problems

• Implement an algorithm to calculate the maximum weight matching in a bipartite graph using dynamic programming.
• Write a program to find the number of spanning trees in a bipartite graph.
• Implement an algorithm to find the shortest path that visits every vertex in a directed graph.
• Write a program to calculate the minimum distance between two nodes in a directed graph.
• Implement an algorithm to solve the "Subtree Isomorphism Problem" in a tree.
• Write a program to find the longest path that visits every edge in a graph.
• Implement an algorithm to find the number of vertex-disjoint paths in a graph.
• Write a program to check if a directed graph is a valid tree.