More Problems

• Write a program to find all leaf nodes in an undirected graph.
• Implement a function to check if a directed graph contains any self-loops using BFS.
• Write a program to print all the edges of a graph sorted by weight.
• Implement a function to calculate the degree centrality of each vertex in an undirected graph.
• Write a program to check if two vertices in an undirected graph are adjacent.
• Implement a function to find the number of spanning trees in a weighted graph.
• Write a program to print all bridges in an undirected graph using BFS.
• Implement a function to check if a graph contains any parallel edges using BFS.