More Problems

• 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.
• Write a program to calculate the number of cycles in a weighted graph using DFS.
• Implement a function to print all vertices that are part of strongly connected components in a graph.
• Write a program to check if a graph contains any Hamiltonian paths using DFS.