More Problems

• Write a program to calculate the degree centrality of each vertex in a directed graph using BFS.
• Implement a function to find the number of simple paths between two vertices in a graph using DFS.
• Write a program to print the adjacency matrix of a weighted directed graph sorted by degree.
• Implement a function to check if two graphs are strongly isomorphic using adjacency matrices.
• Write a program to print all vertices with no incoming edges in a weighted directed graph.
• Implement a function to calculate the total number of spanning trees in a graph using Kirchhoffs theorem.
• Write a program to check if a graph contains any Hamiltonian paths using BFS and DFS.
• Implement a function to find all strongly connected components in a directed graph using adjacency lists.