More Problems

• Implement a function to print all the vertices that are part of Hamiltonian cycles in a graph.
• Write a program to check if a directed graph is strongly connected using BFS.
• Implement a function to calculate the number of simple paths between two vertices in a directed graph.
• Write a program to find the longest path in a weighted graph using DFS.
• Implement a function to print all vertices in a weighted graph sorted by degree.
• Write a program to find the number of vertices with degree zero in a graph.
• Implement a function to check if two directed graphs are strongly connected using adjacency matrices.
• Write a program to calculate the number of strongly connected components in a directed acyclic graph.