More Problems

• Implement a function to find the number of vertices with no incoming edges in a directed acyclic graph.
• Write a program to print the degree of each vertex in a directed acyclic graph.
• Implement a function to print all cycles of a fixed length in a graph.
• Write a program to find the maximum degree in a directed graph using DFS.
• Implement a function to check if a directed graph is bipartite using BFS.
• Write a program to calculate the diameter of an undirected graph.
• Implement a function to check if a directed acyclic graph contains any parallel edges.
• Write a program to find the shortest cycle in a directed graph using BFS.