More Problems

• Write a program to calculate the number of strongly connected components in a directed graph.
• Implement an algorithm to find the shortest path from a source to multiple targets in a graph.
• Write a program to find the chromatic number of a directed graph.
• Implement an algorithm to solve the "Chinese Postman Problem" for directed graphs.
• Write a program to calculate the radius and diameter of a tree.
• Implement an algorithm to find the longest increasing path in a weighted graph.
• Write a program to check if two graphs have the same degree distribution.
• Implement an algorithm to find the minimum number of cuts needed to partition a graph into strongly connected components.