More Problems

• Implement an algorithm to check if a directed graph contains any cycles using DFS.
• Write a program to find the minimum number of edges to remove to make a directed graph acyclic.
• Implement an algorithm to find all articulation points in a weighted graph using DFS.
• Write a program to check if a graph is Eulerian using properties of Eulerian graphs.
• Implement an algorithm to calculate the number of edges in a minimum spanning tree using Kruskal’s algorithm.
• Write a program to find the longest simple path that visits all vertices in a graph.
• Implement an algorithm to find the number of edges in a bipartite graph that form a path.
• Write a program to check if a directed graph is a valid topological sort using DFS.