More Problems

• Implement a function to check if a graph is a perfect matching.
• Write a program to find the largest simple path in an undirected graph.
• Implement a function to check if an undirected graph is Eulerian.
• Write a program to find the total number of cycles in an undirected graph.
• Implement a function to count the number of vertices in the longest path of a tree.
• Write a program to print the adjacency list of a graph in decreasing order of degree.
• Implement a function to check if two nodes are in the same connected component in a directed graph.
• Write a program to print all nodes reachable from a given node in a graph using DFS.