More Problems

• Write a program to find the longest cycle in a weighted directed graph using BFS.
• Implement a function to check if a directed graph contains any Hamiltonian cycles using DFS and BFS.
• Write a program to print the adjacency matrix of a graph sorted by in-degree.
• Implement a function to find the number of articulation points in a graph using adjacency matrices.
• Write a program to calculate the radius of a directed graph using DFS and BFS.
• Implement a function to calculate the number of spanning trees in a weighted directed graph using DFS.
• Write a program to print all vertices with no outgoing edges in a weighted graph.
• Implement a function to check if a graph is strongly connected using BFS and DFS.