More Problems

• Write a program to print the adjacency list of a directed graph sorted by in-degree.
• Implement a function to check if a directed graph contains any Hamiltonian cycles using adjacency lists and BFS.
• Write a program to find the longest simple cycle in a directed acyclic graph using DFS.
• Implement a function to calculate the total number of edge-disjoint paths in a weighted directed graph using DFS.
• Write a program to print all edges in a directed graph that are part of the longest Hamiltonian path.
• Implement a function to calculate the chromatic number of a graph using BFS, DFS, and adjacency lists.
• Write a program to check if a graph contains any Hamiltonian paths using adjacency lists.
• Implement a function to calculate the number of strongly connected components in a graph using DFS and adjacency matrices.