More Problems

• Write a program to check if a bipartite graph can be colored with three colors.
• Implement an algorithm to find all paths from a source vertex in a directed graph using DFS.
• Write a program to check if a directed graph can be made strongly connected by adding edges.
• Implement an algorithm to calculate the number of paths of length k in a directed graph.
• Write a program to find all maximal independent sets in a weighted directed graph.
• Implement an algorithm to find the shortest path between two vertices in a weighted graph using Dijkstras algorithm.
• Write a program to check if a directed graph is Eulerian using Fleurys algorithm.
• Implement an algorithm to find the longest simple path that visits each vertex at least once in a directed graph.