More Problems

• Implement an algorithm to solve the "Minimum Feedback Arc Set Problem" in a directed graph.
• Write a program to find all the bridges in a weighted undirected graph.
• Implement an algorithm to check if a directed graph is strongly regular.
• Write a program to calculate the number of spanning subgraphs in a directed graph.
• Implement an algorithm to calculate the maximum matching in a general graph using DFS.
• Write a program to solve the "Cut Vertex Problem" in a graph.
• Implement an algorithm to calculate the edge-disjoint paths in a directed acyclic graph.
• Write a program to check if a directed graph contains any Hamiltonian cycles.