More Problems

• Write a program to find all the simple paths in a directed graph.
• Implement an algorithm to find the longest path between two nodes in a directed graph.
• Write a program to calculate the total number of paths in a directed acyclic graph.
• 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.