More Problems

• Write a program to find the number of strongly connected components in a directed graph using BFS.
• Implement a function to calculate the total number of edge-disjoint cycles in a weighted directed graph.
• Write a program to print all vertices with no outgoing edges in a weighted directed graph.
• Implement a function to check if a directed acyclic graph contains any Hamiltonian paths using BFS.
• Write a program to find the shortest path between two vertices in a graph using adjacency matrices.
• Implement a function to calculate the chromatic number of a weighted directed acyclic graph using DFS.
• Write a program to print all vertices that form the shortest Hamiltonian cycle in a graph.
• Implement a function to calculate the degree centrality of each vertex in a directed acyclic graph.