More Problems

• Implement an algorithm to calculate the average distance from a source vertex to all other vertices in a weighted directed graph.
• Write a program to find all maximal independent sets in a directed graph using backtracking.
• Implement an algorithm to find the longest path in a weighted bipartite graph using dynamic programming.
• Write a program to check if a directed graph can be made bipartite by removing edges.
• Implement an algorithm to find the shortest path from a source vertex to all other vertices in a directed acyclic graph.
• Write a program to find the maximum matching in a directed graph using augmenting paths.
• Implement an algorithm to find the longest increasing subsequence in a bipartite graph.
• Write a program to check if a directed graph contains any cycles using Kahns algorithm.