More Problems

• Write a program to find the number of simple paths between two vertices in a directed graph.
• Implement a function to check if a graph contains any back edges using DFS.
• Write a program to print all vertices that form the longest simple path in a directed graph.
• Implement a function to calculate the number of spanning trees in a graph using BFS and DFS.
• Write a program to find the longest path in a weighted directed graph using DFS.
• Implement a function to calculate the number of connected subgraphs in a weighted directed graph.
• Write a program to print the degree of each vertex in a weighted directed graph.
• Implement a function to check if a graph contains any cut vertices using adjacency lists.