More Problems

• Write a program to calculate the number of Hamiltonian cycles in a directed graph.
• Implement an algorithm to find the minimum number of edges to remove to make a graph acyclic.
• Write a program to find all paths between two vertices in a directed graph.
• Implement an algorithm to check if a graph is bipartite using DFS and BFS.
• Write a program to compute the transitive closure of a directed graph using Warshalls algorithm.
• Implement an algorithm to find the longest path in a weighted graph using dynamic programming.
• Write a program to find the number of edge-disjoint paths in a directed graph.
• Implement an algorithm to calculate the maximum matching in a general graph using augmenting paths.