More Problems

• Write a program to print the adjacency matrix of a weighted directed acyclic graph.
• Implement a function to find all strongly connected components in a weighted directed graph.
• Write a program to calculate the radius of a directed graph using DFS.
• Implement a function to check if a graph contains any cycles using BFS.
• Write a program to print all articulation points in a directed acyclic graph using DFS.
• Implement a function to calculate the number of edge-disjoint cycles in a weighted graph.
• Write a program to print all vertices in a graph that belong to strongly connected components.
• Implement a function to check if two vertices in a directed graph are adjacent using BFS.