More Problems

• Implement an algorithm to check if a directed graph is a valid topological sort using adjacency lists.
• Write a program to find the shortest path between two vertices in a directed graph using Dijkstras algorithm.
• Implement an algorithm to find the longest path that visits every vertex in a weighted directed graph.
• Write a program to check if a bipartite graph can be colored with two colors using BFS.
• Implement an algorithm to find the maximum matching in a weighted directed graph using the Hungarian method.
• Write a program to find all paths from a source vertex to a target vertex in a directed graph using DFS.
• Implement an algorithm to check if a directed graph is strongly connected using Tarjans algorithm.
• Write a program to find the longest increasing path in a weighted directed graph using dynamic programming.