More Problems

• Implement a function to find the longest simple path in a directed acyclic graph.
• Write a program to check if a graph contains a Hamiltonian path.
• Implement a function to check if a graph is strongly regular.
• Write a program to print all edges in a graph with weights above a given threshold.
• Implement a function to count the number of vertices with degree 1 in a directed graph.
• Write a program to print the topological order of a graph using DFS.
• Implement a function to find the number of connected components in a bipartite graph.
• Write a program to find all leaf nodes in a tree using BFS.