More Problems

• Implement an algorithm to find the diameter of a graph using the double BFS technique.
• Write a program to find all the paths from the source to the sink in a flow network.
• Implement an algorithm to calculate the eccentricity of each vertex in a graph.
• Write a program to find the number of Hamiltonian paths in a bipartite graph.
• Implement an algorithm to find the shortest path between two vertices in a weighted undirected graph.
• Write a program to calculate the number of ways to partition a graph into k connected components.
• Implement an algorithm to find the minimum distance between all pairs of vertices in a graph.
• Write a program to find all paths of a given length in a graph using DFS.