More Problems

• Write a program to print all vertices of a graph with no outgoing edges.
• Implement a function to find the longest simple cycle in a directed graph.
• Write a program to count the number of nodes at each level of a tree.
• Implement a function to check if a directed graph is strongly connected.
• Write a program to print the degree of each vertex in a directed graph.
• 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.