More Problems

• Write a program to print the adjacency matrix of a weighted graph sorted by out-degree and in-degree.
• Implement a function to calculate the number of simple cycles in a directed acyclic graph using BFS and DFS.
• Write a program to check if a directed graph contains any Hamiltonian cycles using DFS and adjacency matrices.
• Implement a function to calculate the number of spanning trees in a weighted graph using DFS and BFS.
• Write a program to print all vertices that form the longest simple path in a directed graph using BFS.
• Implement a function to check if a graph is strongly connected using adjacency matrices and BFS.
• Write a program to calculate the total number of simple paths in a weighted directed graph using adjacency lists.
• Implement a function to find all bridges in a directed graph using BFS and DFS.