More Problems

• Write a program to find all maximal cliques in a bipartite graph using the Bron-Kerbosch algorithm.
• Implement an algorithm to find the longest simple cycle in a weighted graph using DFS.
• Write a program to calculate the distance between any two vertices in a directed acyclic graph.
• Implement an algorithm to check if a directed graph can be made strongly connected by removing edges.
• Write a program to find the shortest cycle in a bipartite graph using BFS.
• Implement an algorithm to find all simple paths in a directed graph using depth-first search.
• Write a program to find the longest path in a directed graph with both positive and negative weights.
• Implement an algorithm to find the number of strongly connected components in a directed graph using BFS.