More Problems

• Write a program to check if a graph contains any parallel edges using an adjacency matrix.
• Implement a function to print all simple paths in a directed acyclic graph.
• Write a program to print all vertices that form a path in a directed acyclic graph.
• Implement a function to find the shortest cycle in an undirected graph using BFS.
• Write a program to find the number of vertices in the smallest strongly connected component in a directed graph.
• Implement a function to check if a directed graph contains any articulation points.
• Write a program to calculate the diameter of a binary tree using DFS.
• Implement a function to check if an undirected graph is strongly connected.