More Problems

• Implement an algorithm to calculate the number of strongly connected components in a directed graph.
• Write a program to check if a directed graph contains any simple cycles using DFS.
• Implement an algorithm to find the longest path in a tree using DFS.
• Write a program to calculate the average degree of vertices in a directed graph.
• Implement an algorithm to find the longest path that visits all edges in a directed graph.
• Write a program to check if two trees are isomorphic using DFS.
• Implement an algorithm to calculate the distance matrix of a bipartite graph.
• Write a program to find all maximal cliques in a weighted bipartite graph using the Bron-Kerbosch algorithm.