More Problems

• Implement a function to calculate the number of spanning subgraphs in a directed acyclic graph using BFS.
• Write a program to print all vertices that form the longest simple cycle in a directed acyclic graph.
• Implement a function to check if a graph contains any cut vertices using adjacency matrices.
• Write a program to find the number of simple paths in a directed graph using DFS.
• Implement a function to calculate the degree centrality of each vertex in a graph using adjacency lists.
• Write a program to print all strongly connected components in a directed graph using BFS and DFS.
• Implement a function to calculate the chromatic number of a graph using DFS and BFS.
• Write a program to find the longest cycle in a weighted directed graph using BFS.