More Problems

• Write a program to find the shortest cycle in a weighted graph using Dijkstras algorithm.
• Implement an algorithm to check if a directed graph can be made bipartite by removing edges.
• Write a program to calculate the number of edge-disjoint paths in a directed graph.
• Implement an algorithm to find all Hamiltonian cycles in a weighted directed graph using backtracking.
• Write a program to check if a directed graph is bipartite using BFS.
• Implement an algorithm to calculate the average degree of vertices in a weighted directed graph.
• Write a program to find all paths from a source vertex to a target vertex in a directed graph using DFS.
• Implement an algorithm to check if a directed graph is strongly connected using Tarjans algorithm.