More Problems

• 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.
• Implement an algorithm to find all maximal independent sets in a directed acyclic graph.
• Write a program to calculate the total number of paths in a bipartite graph.
• 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.