More Problems

• Implement an algorithm to check if two directed graphs are isomorphic using adjacency lists.
• Write a program to find the longest path in a weighted graph using backtracking.
• Implement an algorithm to find the minimum number of edges to add to make a directed graph strongly connected.
• Write a program to calculate the number of edge-disjoint paths in a bipartite graph.
• Implement an algorithm to find all Hamiltonian cycles in a bipartite graph using dynamic programming.
• Write a program to check if a directed graph can be made bipartite.
• Implement an algorithm to find the longest simple cycle in a weighted graph using DFS.
• Write a program to find the shortest path between all pairs of vertices in a directed graph using the Floyd-Warshall algorithm.