More Problems

• Write a program to check if a graph is planar using Kuratowskis theorem.
• Implement an algorithm to find the shortest path that visits every vertex in a weighted graph.
• Write a program to solve the "Chinese Remainder Theorem" using graph techniques.
• Implement an algorithm to calculate the total number of edge-disjoint paths in a directed graph.
• Write a program to find the maximum flow in a bipartite graph using DFS and augmenting paths.
• Implement an algorithm to check if a directed graph is a directed tree.
• Write a program to calculate the number of simple paths in a directed acyclic graph.
• Implement an algorithm to find all vertex-disjoint paths in a weighted directed graph.