More Problems

• Implement an algorithm to find the maximum weight independent set in a weighted graph.
• Write a program to check if a graph can be colored using three colors.
• Implement an algorithm to find the longest path in a tree using dynamic programming.
• Write a program to find the shortest path in a graph with both positive and negative edge weights using Johnsons algorithm.
• Implement a function to calculate the number of spanning trees in a complete graph.
• Write a program to check if a directed graph is acyclic using topological sorting.
• Implement an algorithm to find the minimum number of edges to add to make a graph connected.
• Write a program to find all nodes reachable from a given node in a directed graph.