More Problems

• Write a program to check if a graph is bipartite using adjacency matrices.
• Implement an algorithm to find the shortest path from a source to a sink in a directed graph.
• Write a program to calculate the chromatic index of a bipartite graph.
• Implement an algorithm to find all paths from a source to a target in an unweighted graph.
• Write a program to check if a directed graph has a unique topological ordering.
• Implement an algorithm to calculate the average distance from a source vertex to all other vertices in a directed graph.
• Write a program to find the longest path that visits each vertex at least once in a directed graph.
• Implement an algorithm to find the longest increasing subsequence in a weighted directed graph.