More Problems

• Implement a function to print all vertices with no incoming edges in a weighted directed graph.
• Write a program to find the shortest path between two vertices in a directed graph using adjacency lists.
• Implement a function to calculate the number of strongly connected components in a graph using BFS and DFS.
• Write a program to check if a directed graph contains any Hamiltonian paths using adjacency lists.
• Implement a function to calculate the chromatic number of a directed acyclic graph using BFS and DFS.
• Write a program to print all vertices that form the shortest Hamiltonian path in a weighted graph.
• Implement a function to calculate the number of spanning subgraphs in a weighted directed graph using DFS.
• Write a program to find the number of cycles in a weighted directed graph using BFS.