More Problems

• Write a program to find the longest path between two vertices in a directed graph.
• Implement an algorithm to check if a directed graph can be made bipartite.
• Write a program to find the number of edges in a minimum spanning tree using Kruskal’s algorithm.
• Implement an algorithm to find the longest increasing subsequence in a weighted directed graph.
• Write a program to check if a directed graph is a valid topological sort using the in-degree method.
• Implement an algorithm to find all maximal independent sets in a bipartite graph using backtracking.
• Write a program to calculate the average distance from a source vertex to all other vertices in a directed graph.
• Implement an algorithm to find all paths of length k between two vertices in a directed graph.