More Problems

• Write a program to find the number of strongly connected components in a directed graph using adjacency lists.
• Implement a function to calculate the number of spanning subgraphs in a graph using DFS and BFS.
• Write a program to print all vertices with degree greater than or equal to 2 in a directed acyclic graph.
• Implement a function to check if a graph is strongly connected using BFS and adjacency matrices.
• Write a program to calculate the total number of connected components in a directed acyclic graph.
• Implement a function to print all vertices that form the longest simple path in a graph using adjacency matrices.
• Write a program to find the shortest cycle in a weighted graph using DFS.
• Implement a function to check if a directed acyclic graph contains any Hamiltonian paths using adjacency matrices.