More Problems

• 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.
• Write a program to calculate the degree centrality of each vertex in a graph.
• Implement a function to find the edge-connectivity of a graph.
• Write a program to find the vertex-connectivity of a graph.
• Implement a function to check if a graph is connected after removing a vertex.