More Problems

• Write a program to check if a directed graph has an Eulerian path using Fleurys algorithm.
• Implement an algorithm to find the longest path in a directed graph with positive weights.
• Write a program to calculate the shortest path between all pairs of vertices in a directed graph.
• Implement an algorithm to find the shortest path using A* search in a weighted graph.
• Write a program to find all bridges in a directed graph using DFS.
• Implement an algorithm to calculate the number of spanning trees in a directed graph using DFS.
• Write a program to check if a graph is a tree using its properties.
• Implement an algorithm to find the longest cycle in a directed graph using dynamic programming.