More Problems

• Implement an algorithm to calculate the number of edge-disjoint spanning trees in a weighted graph.
• Write a program to check if a directed graph is a valid topological sort.
• Implement an algorithm to find the longest path that visits each vertex at least once in a directed graph.
• Write a program to solve the "Multi-Commodity Flow Problem" in a graph.
• Implement an algorithm to calculate the maximum flow using the preflow-push algorithm.
• Write a program to find all articulation points in a weighted graph.
• Implement an algorithm to check if a directed graph is strongly connected using Tarjan’s algorithm.
• Write a program to find the maximum number of vertex-disjoint paths in a weighted graph.