More Problems

• Write a program to find the shortest path between two vertices in a directed graph using Dijkstras algorithm.
• Implement an algorithm to calculate the number of edges in a minimum spanning tree using Kruskal’s algorithm.
• Write a program to find all articulation points in a directed graph using DFS.
• Implement an algorithm to check if a graph is connected using BFS or DFS.
• Write a program to find the diameter of a graph using two BFS runs.
• Implement an algorithm to find the longest increasing subsequence in a directed graph using dynamic programming.
• Write a program to check if a bipartite graph can be partitioned into two equal parts.
• Implement an algorithm to calculate the number of spanning trees in a directed graph using Kirchhoffs theorem.