More Problems

• Implement a function to check if a graph is Hamiltonian.
• Write a program to calculate the transitive closure of a directed graph using DFS.
• Implement a function to print all simple cycles in a directed graph.
• Write a program to find the longest common subsequence between two strings using graph techniques.
• Implement a function to find the total number of nodes at a given depth in a tree.
• Write a program to find all nodes in a graph that have degree 2.
• Implement a function to check if a graph contains any cut edges.
• Write a program to print all bridges in a directed graph.