More Problems

• Write a program to find the longest increasing path in a weighted directed graph.
• Implement an algorithm to find all Hamiltonian paths in a directed graph using dynamic programming.
• Write a program to check if a directed graph contains any cycles using the Floyd-Warshall algorithm.
• Implement an algorithm to find the longest path that visits each edge at least once in a directed graph.
• Write a program to find the minimum spanning tree in a graph with both positive and negative edges using Kruskal’s algorithm.
• Implement an algorithm to check if two directed graphs are isomorphic using the adjacency list representation.
• Write a program to find all maximal independent sets in a directed graph.
• Implement an algorithm to calculate the number of edge-disjoint paths in a directed bipartite graph.