More Problems

• Write a program to print all vertices that belong to the smallest connected component in a graph.
• Implement a function to check if two graphs are isomorphic using adjacency lists.
• Write a program to find the number of spanning trees in a weighted graph using BFS.
• Implement a function to calculate the degree centrality of each vertex in a directed graph.
• Write a program to print all vertices with degree greater than 2 in a directed acyclic graph.
• Implement a function to find the longest path in a directed graph using BFS.
• Write a program to print the adjacency list of a weighted directed acyclic graph.
• Implement a function to check if a directed acyclic graph contains any parallel edges using adjacency lists.