More Problems

• Write a program to print all nodes with no incoming edges in a directed graph.
• Implement a function to find the longest path in an undirected acyclic graph.
• Write a program to find the total number of simple paths between two vertices in a graph.
• Implement a function to check if a graph has a Hamiltonian cycle using BFS.
• Write a program to print all isolated vertices in a directed graph.
• Implement a function to detect if two graphs are isomorphic by comparing their adjacency matrices.
• Write a program to find the longest path between two nodes in a tree using BFS.
• Implement a function to print all vertices in a graph that have no outgoing edges.