More Problems

• Write a program to find the number of maximal independent sets in a directed graph.
• Implement an algorithm to calculate the transitive closure of a directed graph using Floyd-Warshall.
• Write a program to check if a directed graph can be 3-colored.
• Implement an algorithm to find the longest increasing subsequence in a bipartite graph.
• Write a program to check if a directed graph contains a unique path between any two vertices.
• Implement an algorithm to find the longest path in a weighted directed graph using the Bellman-Ford algorithm.
• Write a program to calculate the number of edges in a minimum spanning tree of a directed graph.
• Implement an algorithm to find the longest path that visits every edge of a bipartite graph.