More Problems

• Implement an algorithm to check if a bipartite graph is k-colorable using a greedy approach.
• Write a program to find the longest path that visits every edge in a directed graph.
• Implement an algorithm to find all paths of length k in a weighted directed graph.
• Write a program to check if a directed graph contains any cycles using Tarjans algorithm.
• Implement an algorithm to find the maximum matching in a bipartite graph using the Hungarian algorithm.
• Write a program to check if a directed graph is strongly connected using Kosarajus algorithm.
• Implement an algorithm to find the longest path in a weighted directed graph using dynamic programming.
• Write a program to calculate the average distance from a source vertex to all other vertices in a directed bipartite graph.