More Problems

• Write a program to check if a directed graph contains any Hamiltonian paths using BFS and adjacency lists.
• Implement a function to calculate the total number of spanning trees in a graph using BFS, DFS, and adjacency matrices.
• Write a program to print all vertices with degree zero in a directed acyclic graph.
• Implement a function to find all strongly connected components in a weighted directed graph using BFS.
• Write a program to print the adjacency matrix of a directed acyclic graph sorted by in-degree and out-degree.
• Implement a function to check if two graphs are isomorphic using adjacency matrices and BFS.
• Write a program to calculate the number of simple cycles in a directed graph using adjacency lists and DFS.
• Implement a function to calculate the degree centrality of each vertex in a weighted directed graph using BFS and DFS.