More Problems

• Write a program to check if a graph is complete.
• Implement a function to print the topological order of a DAG.
• Write a program to find the number of vertices with degree one.
• Implement a function to check if two vertices are in the same strongly connected component.
• Write a program to print all vertices in decreasing order of their degrees.
• Implement a function to check if a directed graph is strongly connected.
• Write a program to check if two graphs have the same degree sequence.
• Implement a function to find the longest simple cycle in an undirected graph.